./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4144526f9721d9117c49073b68e4e0099460963f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:30,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:30,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:30,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:30,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:30,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:30,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:30,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:30,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:30,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:30,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:30,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:30,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:30,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:30,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:30,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:30,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:30,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:30,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:30,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:30,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:30,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:30,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:30,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:30,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:30,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:30,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:30,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:30,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:30,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:30,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:30,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:30,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:30,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:30,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:30,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:30,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:30,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:30,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:30,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:30,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:30,196 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:30,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:30,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:30,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:30,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:30,209 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:30,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:30,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:30,211 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:30,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:30,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:30,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:30,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:30,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:30,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:30,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:30,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:30,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:30,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:30,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:30,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:30,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:30,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:30,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4144526f9721d9117c49073b68e4e0099460963f [2019-10-22 08:55:30,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:30,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:30,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:30,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:30,262 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:30,263 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.opt.i [2019-10-22 08:55:30,308 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/data/78add9cf5/e24384089b6b4b5e80394b1eb5445a02/FLAGf1ebe7065 [2019-10-22 08:55:30,786 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:30,787 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/sv-benchmarks/c/pthread-wmm/mix054_power.opt.i [2019-10-22 08:55:30,815 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/data/78add9cf5/e24384089b6b4b5e80394b1eb5445a02/FLAGf1ebe7065 [2019-10-22 08:55:31,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/data/78add9cf5/e24384089b6b4b5e80394b1eb5445a02 [2019-10-22 08:55:31,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:31,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:31,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:31,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:31,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:31,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630b61e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31, skipping insertion in model container [2019-10-22 08:55:31,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:31,185 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:31,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:31,686 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:31,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:31,798 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:31,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31 WrapperNode [2019-10-22 08:55:31,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:31,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:31,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:31,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:31,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:31,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:31,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:31,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:31,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... [2019-10-22 08:55:31,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:31,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:31,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:31,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:31,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/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-22 08:55:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 08:55:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 08:55:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 08:55:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 08:55:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 08:55:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 08:55:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:31,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:31,984 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 08:55:32,604 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:32,604 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:32,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:32 BoogieIcfgContainer [2019-10-22 08:55:32,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:32,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:32,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:32,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:32,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:31" (1/3) ... [2019-10-22 08:55:32,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2688f226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:32, skipping insertion in model container [2019-10-22 08:55:32,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:31" (2/3) ... [2019-10-22 08:55:32,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2688f226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:32, skipping insertion in model container [2019-10-22 08:55:32,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:32" (3/3) ... [2019-10-22 08:55:32,620 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-10-22 08:55:32,678 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,678 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,679 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,679 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,679 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,679 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,679 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,680 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,680 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,683 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,683 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,684 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,684 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,684 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,684 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,684 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,684 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,685 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,685 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,685 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,685 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,685 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,686 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,686 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,686 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,686 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,686 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,686 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,687 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,687 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,687 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,691 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,691 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,691 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,691 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,692 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,692 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,693 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,694 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,694 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,694 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,694 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,694 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,694 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,695 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,695 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,697 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,700 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,700 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,700 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,701 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,701 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,701 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,701 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,701 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,702 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,703 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,703 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,703 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,703 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,703 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,703 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,704 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,705 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,705 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,705 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,705 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,705 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,705 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,706 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,706 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,706 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,706 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,706 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,706 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,707 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,707 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,707 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,712 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,712 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,712 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,713 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,714 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,714 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,714 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,714 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,714 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,715 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,715 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,715 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,720 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,721 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,722 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,723 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,724 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,725 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,726 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:32,734 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 08:55:32,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:32,741 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:55:32,750 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:55:32,769 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:32,769 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:32,769 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:32,769 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:32,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:32,769 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:32,769 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:32,770 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:32,780 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-10-22 08:55:35,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2019-10-22 08:55:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2019-10-22 08:55:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:55:35,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:35,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:35,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1417398579, now seen corresponding path program 1 times [2019-10-22 08:55:35,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399172911] [2019-10-22 08:55:35,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:35,553 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-22 08:55:35,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399172911] [2019-10-22 08:55:35,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:35,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:35,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864471244] [2019-10-22 08:55:35,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:35,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:35,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:35,574 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2019-10-22 08:55:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:36,266 INFO L93 Difference]: Finished difference Result 35833 states and 137562 transitions. [2019-10-22 08:55:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:36,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 08:55:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:36,457 INFO L225 Difference]: With dead ends: 35833 [2019-10-22 08:55:36,457 INFO L226 Difference]: Without dead ends: 27337 [2019-10-22 08:55:36,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 08:55:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-10-22 08:55:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 27337. [2019-10-22 08:55:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2019-10-22 08:55:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2019-10-22 08:55:37,642 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2019-10-22 08:55:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:37,642 INFO L462 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2019-10-22 08:55:37,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2019-10-22 08:55:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:55:37,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:37,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:37,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1163149579, now seen corresponding path program 1 times [2019-10-22 08:55:37,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:37,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619140752] [2019-10-22 08:55:37,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:37,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:37,812 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-22 08:55:37,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619140752] [2019-10-22 08:55:37,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:37,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:37,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636705691] [2019-10-22 08:55:37,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:37,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:37,816 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 5 states. [2019-10-22 08:55:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:38,500 INFO L93 Difference]: Finished difference Result 43807 states and 159850 transitions. [2019-10-22 08:55:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:38,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 08:55:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:38,684 INFO L225 Difference]: With dead ends: 43807 [2019-10-22 08:55:38,684 INFO L226 Difference]: Without dead ends: 43255 [2019-10-22 08:55:38,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43255 states. [2019-10-22 08:55:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43255 to 41419. [2019-10-22 08:55:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41419 states. [2019-10-22 08:55:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41419 states to 41419 states and 152328 transitions. [2019-10-22 08:55:40,427 INFO L78 Accepts]: Start accepts. Automaton has 41419 states and 152328 transitions. Word has length 44 [2019-10-22 08:55:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:40,428 INFO L462 AbstractCegarLoop]: Abstraction has 41419 states and 152328 transitions. [2019-10-22 08:55:40,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 41419 states and 152328 transitions. [2019-10-22 08:55:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:55:40,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:40,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:40,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash 605576156, now seen corresponding path program 1 times [2019-10-22 08:55:40,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:40,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420693729] [2019-10-22 08:55:40,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:40,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:40,545 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-22 08:55:40,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420693729] [2019-10-22 08:55:40,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:40,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:40,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436554015] [2019-10-22 08:55:40,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:40,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:40,546 INFO L87 Difference]: Start difference. First operand 41419 states and 152328 transitions. Second operand 5 states. [2019-10-22 08:55:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:41,053 INFO L93 Difference]: Finished difference Result 52769 states and 191023 transitions. [2019-10-22 08:55:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:41,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 08:55:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:41,262 INFO L225 Difference]: With dead ends: 52769 [2019-10-22 08:55:41,263 INFO L226 Difference]: Without dead ends: 52257 [2019-10-22 08:55:41,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52257 states. [2019-10-22 08:55:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52257 to 45373. [2019-10-22 08:55:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45373 states. [2019-10-22 08:55:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45373 states to 45373 states and 166016 transitions. [2019-10-22 08:55:42,854 INFO L78 Accepts]: Start accepts. Automaton has 45373 states and 166016 transitions. Word has length 45 [2019-10-22 08:55:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:42,855 INFO L462 AbstractCegarLoop]: Abstraction has 45373 states and 166016 transitions. [2019-10-22 08:55:42,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45373 states and 166016 transitions. [2019-10-22 08:55:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:55:42,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:42,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:42,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1184682590, now seen corresponding path program 1 times [2019-10-22 08:55:42,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:42,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058178287] [2019-10-22 08:55:42,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:42,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:42,936 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-22 08:55:42,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058178287] [2019-10-22 08:55:42,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:42,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:42,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712944702] [2019-10-22 08:55:42,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:42,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:42,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:42,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:42,938 INFO L87 Difference]: Start difference. First operand 45373 states and 166016 transitions. Second operand 3 states. [2019-10-22 08:55:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:43,225 INFO L93 Difference]: Finished difference Result 65249 states and 235812 transitions. [2019-10-22 08:55:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:43,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 08:55:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:43,414 INFO L225 Difference]: With dead ends: 65249 [2019-10-22 08:55:43,414 INFO L226 Difference]: Without dead ends: 65249 [2019-10-22 08:55:43,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65249 states. [2019-10-22 08:55:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65249 to 50943. [2019-10-22 08:55:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50943 states. [2019-10-22 08:55:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50943 states to 50943 states and 184323 transitions. [2019-10-22 08:55:45,120 INFO L78 Accepts]: Start accepts. Automaton has 50943 states and 184323 transitions. Word has length 47 [2019-10-22 08:55:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:45,120 INFO L462 AbstractCegarLoop]: Abstraction has 50943 states and 184323 transitions. [2019-10-22 08:55:45,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 50943 states and 184323 transitions. [2019-10-22 08:55:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:55:45,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:45,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:45,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash 388757837, now seen corresponding path program 1 times [2019-10-22 08:55:45,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:45,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230761950] [2019-10-22 08:55:45,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:45,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:45,235 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-22 08:55:45,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230761950] [2019-10-22 08:55:45,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:45,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:45,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085126492] [2019-10-22 08:55:45,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:45,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:45,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:45,237 INFO L87 Difference]: Start difference. First operand 50943 states and 184323 transitions. Second operand 6 states. [2019-10-22 08:55:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:46,011 INFO L93 Difference]: Finished difference Result 67509 states and 242183 transitions. [2019-10-22 08:55:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:46,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 08:55:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:46,156 INFO L225 Difference]: With dead ends: 67509 [2019-10-22 08:55:46,156 INFO L226 Difference]: Without dead ends: 67509 [2019-10-22 08:55:46,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67509 states. [2019-10-22 08:55:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67509 to 63434. [2019-10-22 08:55:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63434 states. [2019-10-22 08:55:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63434 states to 63434 states and 227582 transitions. [2019-10-22 08:55:47,834 INFO L78 Accepts]: Start accepts. Automaton has 63434 states and 227582 transitions. Word has length 51 [2019-10-22 08:55:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:47,835 INFO L462 AbstractCegarLoop]: Abstraction has 63434 states and 227582 transitions. [2019-10-22 08:55:47,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 63434 states and 227582 transitions. [2019-10-22 08:55:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:55:47,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:47,850 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:47,851 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1408193522, now seen corresponding path program 1 times [2019-10-22 08:55:47,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:47,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950104047] [2019-10-22 08:55:47,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:47,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:47,936 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-22 08:55:47,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950104047] [2019-10-22 08:55:47,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:47,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:47,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139457380] [2019-10-22 08:55:47,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:47,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:47,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:47,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:47,937 INFO L87 Difference]: Start difference. First operand 63434 states and 227582 transitions. Second operand 5 states. [2019-10-22 08:55:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:48,028 INFO L93 Difference]: Finished difference Result 15373 states and 48824 transitions. [2019-10-22 08:55:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:48,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-22 08:55:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:48,046 INFO L225 Difference]: With dead ends: 15373 [2019-10-22 08:55:48,047 INFO L226 Difference]: Without dead ends: 13787 [2019-10-22 08:55:48,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13787 states. [2019-10-22 08:55:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13787 to 13738. [2019-10-22 08:55:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13738 states. [2019-10-22 08:55:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 43350 transitions. [2019-10-22 08:55:48,220 INFO L78 Accepts]: Start accepts. Automaton has 13738 states and 43350 transitions. Word has length 51 [2019-10-22 08:55:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:48,220 INFO L462 AbstractCegarLoop]: Abstraction has 13738 states and 43350 transitions. [2019-10-22 08:55:48,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13738 states and 43350 transitions. [2019-10-22 08:55:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:55:48,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:48,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:48,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2094486829, now seen corresponding path program 1 times [2019-10-22 08:55:48,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372952383] [2019-10-22 08:55:48,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,310 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-22 08:55:48,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372952383] [2019-10-22 08:55:48,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:48,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:48,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441103659] [2019-10-22 08:55:48,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:48,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:48,312 INFO L87 Difference]: Start difference. First operand 13738 states and 43350 transitions. Second operand 6 states. [2019-10-22 08:55:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:48,701 INFO L93 Difference]: Finished difference Result 17066 states and 53146 transitions. [2019-10-22 08:55:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:48,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 08:55:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:48,726 INFO L225 Difference]: With dead ends: 17066 [2019-10-22 08:55:48,726 INFO L226 Difference]: Without dead ends: 16994 [2019-10-22 08:55:48,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16994 states. [2019-10-22 08:55:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16994 to 14312. [2019-10-22 08:55:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14312 states. [2019-10-22 08:55:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14312 states to 14312 states and 45047 transitions. [2019-10-22 08:55:48,920 INFO L78 Accepts]: Start accepts. Automaton has 14312 states and 45047 transitions. Word has length 51 [2019-10-22 08:55:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:48,920 INFO L462 AbstractCegarLoop]: Abstraction has 14312 states and 45047 transitions. [2019-10-22 08:55:48,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 14312 states and 45047 transitions. [2019-10-22 08:55:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:55:48,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:48,923 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:48,924 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1957998967, now seen corresponding path program 1 times [2019-10-22 08:55:48,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89109759] [2019-10-22 08:55:48,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:48,970 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-22 08:55:48,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89109759] [2019-10-22 08:55:48,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:48,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:48,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020260541] [2019-10-22 08:55:48,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:48,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:48,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:48,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:48,972 INFO L87 Difference]: Start difference. First operand 14312 states and 45047 transitions. Second operand 4 states. [2019-10-22 08:55:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:49,095 INFO L93 Difference]: Finished difference Result 16615 states and 52375 transitions. [2019-10-22 08:55:49,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:49,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 08:55:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:49,116 INFO L225 Difference]: With dead ends: 16615 [2019-10-22 08:55:49,116 INFO L226 Difference]: Without dead ends: 16615 [2019-10-22 08:55:49,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16615 states. [2019-10-22 08:55:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16615 to 15132. [2019-10-22 08:55:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15132 states. [2019-10-22 08:55:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15132 states to 15132 states and 47637 transitions. [2019-10-22 08:55:49,313 INFO L78 Accepts]: Start accepts. Automaton has 15132 states and 47637 transitions. Word has length 59 [2019-10-22 08:55:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:49,313 INFO L462 AbstractCegarLoop]: Abstraction has 15132 states and 47637 transitions. [2019-10-22 08:55:49,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 15132 states and 47637 transitions. [2019-10-22 08:55:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:55:49,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:49,318 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:49,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash -215188632, now seen corresponding path program 1 times [2019-10-22 08:55:49,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:49,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875180167] [2019-10-22 08:55:49,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:49,385 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-22 08:55:49,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875180167] [2019-10-22 08:55:49,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:49,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:49,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470273069] [2019-10-22 08:55:49,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:49,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:49,386 INFO L87 Difference]: Start difference. First operand 15132 states and 47637 transitions. Second operand 6 states. [2019-10-22 08:55:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:49,770 INFO L93 Difference]: Finished difference Result 18450 states and 57254 transitions. [2019-10-22 08:55:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:49,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-22 08:55:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:49,794 INFO L225 Difference]: With dead ends: 18450 [2019-10-22 08:55:49,794 INFO L226 Difference]: Without dead ends: 18379 [2019-10-22 08:55:49,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18379 states. [2019-10-22 08:55:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18379 to 17410. [2019-10-22 08:55:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17410 states. [2019-10-22 08:55:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17410 states to 17410 states and 54311 transitions. [2019-10-22 08:55:50,005 INFO L78 Accepts]: Start accepts. Automaton has 17410 states and 54311 transitions. Word has length 59 [2019-10-22 08:55:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:50,005 INFO L462 AbstractCegarLoop]: Abstraction has 17410 states and 54311 transitions. [2019-10-22 08:55:50,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17410 states and 54311 transitions. [2019-10-22 08:55:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:55:50,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:50,010 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:50,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 424326332, now seen corresponding path program 1 times [2019-10-22 08:55:50,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:50,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272892707] [2019-10-22 08:55:50,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:50,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:50,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:50,051 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-22 08:55:50,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272892707] [2019-10-22 08:55:50,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:50,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:50,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147369278] [2019-10-22 08:55:50,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:50,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:50,053 INFO L87 Difference]: Start difference. First operand 17410 states and 54311 transitions. Second operand 4 states. [2019-10-22 08:55:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:50,386 INFO L93 Difference]: Finished difference Result 24408 states and 74495 transitions. [2019-10-22 08:55:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:50,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 08:55:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:50,418 INFO L225 Difference]: With dead ends: 24408 [2019-10-22 08:55:50,418 INFO L226 Difference]: Without dead ends: 24336 [2019-10-22 08:55:50,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24336 states. [2019-10-22 08:55:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24336 to 19176. [2019-10-22 08:55:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2019-10-22 08:55:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 59215 transitions. [2019-10-22 08:55:50,681 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 59215 transitions. Word has length 63 [2019-10-22 08:55:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:50,682 INFO L462 AbstractCegarLoop]: Abstraction has 19176 states and 59215 transitions. [2019-10-22 08:55:50,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 59215 transitions. [2019-10-22 08:55:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:55:50,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:50,689 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:50,689 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash -820438149, now seen corresponding path program 1 times [2019-10-22 08:55:50,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:50,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659618264] [2019-10-22 08:55:50,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:50,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:50,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:50,776 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-22 08:55:50,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659618264] [2019-10-22 08:55:50,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:50,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:50,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873740839] [2019-10-22 08:55:50,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:50,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:50,778 INFO L87 Difference]: Start difference. First operand 19176 states and 59215 transitions. Second operand 4 states. [2019-10-22 08:55:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:51,126 INFO L93 Difference]: Finished difference Result 23415 states and 71445 transitions. [2019-10-22 08:55:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:51,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 08:55:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:51,173 INFO L225 Difference]: With dead ends: 23415 [2019-10-22 08:55:51,173 INFO L226 Difference]: Without dead ends: 23415 [2019-10-22 08:55:51,173 INFO L600 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-22 08:55:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23415 states. [2019-10-22 08:55:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23415 to 19450. [2019-10-22 08:55:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-10-22 08:55:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 59973 transitions. [2019-10-22 08:55:51,480 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 59973 transitions. Word has length 63 [2019-10-22 08:55:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:51,481 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 59973 transitions. [2019-10-22 08:55:51,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 59973 transitions. [2019-10-22 08:55:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:55:51,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:51,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:51,488 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1397319804, now seen corresponding path program 1 times [2019-10-22 08:55:51,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:51,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492366643] [2019-10-22 08:55:51,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,526 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-22 08:55:51,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492366643] [2019-10-22 08:55:51,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:51,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:51,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707924928] [2019-10-22 08:55:51,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:51,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:51,528 INFO L87 Difference]: Start difference. First operand 19450 states and 59973 transitions. Second operand 3 states. [2019-10-22 08:55:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:51,798 INFO L93 Difference]: Finished difference Result 19970 states and 61393 transitions. [2019-10-22 08:55:51,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:51,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 08:55:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:51,825 INFO L225 Difference]: With dead ends: 19970 [2019-10-22 08:55:51,825 INFO L226 Difference]: Without dead ends: 19970 [2019-10-22 08:55:51,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19970 states. [2019-10-22 08:55:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19970 to 19710. [2019-10-22 08:55:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19710 states. [2019-10-22 08:55:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19710 states to 19710 states and 60663 transitions. [2019-10-22 08:55:52,077 INFO L78 Accepts]: Start accepts. Automaton has 19710 states and 60663 transitions. Word has length 63 [2019-10-22 08:55:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 19710 states and 60663 transitions. [2019-10-22 08:55:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19710 states and 60663 transitions. [2019-10-22 08:55:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:55:52,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:52,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,086 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash 376411073, now seen corresponding path program 1 times [2019-10-22 08:55:52,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75817345] [2019-10-22 08:55:52,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,182 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-22 08:55:52,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75817345] [2019-10-22 08:55:52,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:52,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773984165] [2019-10-22 08:55:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:52,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:52,184 INFO L87 Difference]: Start difference. First operand 19710 states and 60663 transitions. Second operand 6 states. [2019-10-22 08:55:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,602 INFO L93 Difference]: Finished difference Result 21322 states and 64528 transitions. [2019-10-22 08:55:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:52,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 08:55:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:52,633 INFO L225 Difference]: With dead ends: 21322 [2019-10-22 08:55:52,633 INFO L226 Difference]: Without dead ends: 21322 [2019-10-22 08:55:52,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21322 states. [2019-10-22 08:55:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21322 to 19934. [2019-10-22 08:55:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19934 states. [2019-10-22 08:55:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19934 states to 19934 states and 60933 transitions. [2019-10-22 08:55:52,913 INFO L78 Accepts]: Start accepts. Automaton has 19934 states and 60933 transitions. Word has length 65 [2019-10-22 08:55:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:52,913 INFO L462 AbstractCegarLoop]: Abstraction has 19934 states and 60933 transitions. [2019-10-22 08:55:52,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19934 states and 60933 transitions. [2019-10-22 08:55:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:55:52,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:52,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,924 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 587761986, now seen corresponding path program 1 times [2019-10-22 08:55:52,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264704914] [2019-10-22 08:55:52,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,981 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-22 08:55:52,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264704914] [2019-10-22 08:55:52,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:52,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648741079] [2019-10-22 08:55:52,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:52,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:52,983 INFO L87 Difference]: Start difference. First operand 19934 states and 60933 transitions. Second operand 5 states. [2019-10-22 08:55:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:53,334 INFO L93 Difference]: Finished difference Result 25454 states and 77367 transitions. [2019-10-22 08:55:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:53,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 08:55:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:53,375 INFO L225 Difference]: With dead ends: 25454 [2019-10-22 08:55:53,375 INFO L226 Difference]: Without dead ends: 25454 [2019-10-22 08:55:53,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25454 states. [2019-10-22 08:55:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25454 to 23338. [2019-10-22 08:55:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23338 states. [2019-10-22 08:55:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23338 states to 23338 states and 70904 transitions. [2019-10-22 08:55:53,802 INFO L78 Accepts]: Start accepts. Automaton has 23338 states and 70904 transitions. Word has length 65 [2019-10-22 08:55:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:53,803 INFO L462 AbstractCegarLoop]: Abstraction has 23338 states and 70904 transitions. [2019-10-22 08:55:53,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23338 states and 70904 transitions. [2019-10-22 08:55:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:55:53,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:53,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:53,813 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash 77227809, now seen corresponding path program 1 times [2019-10-22 08:55:53,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:53,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812138805] [2019-10-22 08:55:53,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:53,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,870 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-22 08:55:53,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812138805] [2019-10-22 08:55:53,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:53,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:53,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319510643] [2019-10-22 08:55:53,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:53,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:53,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:53,871 INFO L87 Difference]: Start difference. First operand 23338 states and 70904 transitions. Second operand 5 states. [2019-10-22 08:55:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:54,325 INFO L93 Difference]: Finished difference Result 34432 states and 103272 transitions. [2019-10-22 08:55:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:54,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 08:55:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:54,395 INFO L225 Difference]: With dead ends: 34432 [2019-10-22 08:55:54,395 INFO L226 Difference]: Without dead ends: 34432 [2019-10-22 08:55:54,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34432 states. [2019-10-22 08:55:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34432 to 27780. [2019-10-22 08:55:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27780 states. [2019-10-22 08:55:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27780 states to 27780 states and 83467 transitions. [2019-10-22 08:55:54,816 INFO L78 Accepts]: Start accepts. Automaton has 27780 states and 83467 transitions. Word has length 65 [2019-10-22 08:55:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:54,816 INFO L462 AbstractCegarLoop]: Abstraction has 27780 states and 83467 transitions. [2019-10-22 08:55:54,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27780 states and 83467 transitions. [2019-10-22 08:55:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:55:54,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:54,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:54,828 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1730226654, now seen corresponding path program 1 times [2019-10-22 08:55:54,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:54,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241901408] [2019-10-22 08:55:54,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:54,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:54,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:54,877 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-22 08:55:54,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241901408] [2019-10-22 08:55:54,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:54,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:54,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266966772] [2019-10-22 08:55:54,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:54,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:54,878 INFO L87 Difference]: Start difference. First operand 27780 states and 83467 transitions. Second operand 4 states. [2019-10-22 08:55:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:55,351 INFO L93 Difference]: Finished difference Result 36580 states and 110203 transitions. [2019-10-22 08:55:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:55,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 08:55:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:55,406 INFO L225 Difference]: With dead ends: 36580 [2019-10-22 08:55:55,406 INFO L226 Difference]: Without dead ends: 36388 [2019-10-22 08:55:55,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36388 states. [2019-10-22 08:55:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36388 to 33740. [2019-10-22 08:55:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33740 states. [2019-10-22 08:55:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33740 states to 33740 states and 101713 transitions. [2019-10-22 08:55:55,851 INFO L78 Accepts]: Start accepts. Automaton has 33740 states and 101713 transitions. Word has length 65 [2019-10-22 08:55:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:55,851 INFO L462 AbstractCegarLoop]: Abstraction has 33740 states and 101713 transitions. [2019-10-22 08:55:55,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 33740 states and 101713 transitions. [2019-10-22 08:55:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:55:55,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:55,862 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:55,862 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 767789283, now seen corresponding path program 1 times [2019-10-22 08:55:55,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314226169] [2019-10-22 08:55:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:55,921 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-22 08:55:55,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314226169] [2019-10-22 08:55:55,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:55,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:55,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207044662] [2019-10-22 08:55:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:55,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:55,923 INFO L87 Difference]: Start difference. First operand 33740 states and 101713 transitions. Second operand 5 states. [2019-10-22 08:55:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:55,980 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2019-10-22 08:55:55,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:55,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 08:55:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:55,988 INFO L225 Difference]: With dead ends: 8356 [2019-10-22 08:55:55,988 INFO L226 Difference]: Without dead ends: 6588 [2019-10-22 08:55:55,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2019-10-22 08:55:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2019-10-22 08:55:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-10-22 08:55:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2019-10-22 08:55:56,045 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2019-10-22 08:55:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:56,045 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2019-10-22 08:55:56,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2019-10-22 08:55:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:55:56,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:56,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:56,048 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash 3166969, now seen corresponding path program 1 times [2019-10-22 08:55:56,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120377061] [2019-10-22 08:55:56,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,078 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-22 08:55:56,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120377061] [2019-10-22 08:55:56,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:56,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:56,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740993471] [2019-10-22 08:55:56,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:56,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:56,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:56,079 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2019-10-22 08:55:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:56,119 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2019-10-22 08:55:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:56,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 08:55:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:56,127 INFO L225 Difference]: With dead ends: 7236 [2019-10-22 08:55:56,127 INFO L226 Difference]: Without dead ends: 7236 [2019-10-22 08:55:56,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2019-10-22 08:55:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2019-10-22 08:55:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-10-22 08:55:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2019-10-22 08:55:56,187 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2019-10-22 08:55:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:56,187 INFO L462 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2019-10-22 08:55:56,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2019-10-22 08:55:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 08:55:56,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:56,191 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:56,191 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1155493780, now seen corresponding path program 1 times [2019-10-22 08:55:56,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223824612] [2019-10-22 08:55:56,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,242 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-22 08:55:56,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223824612] [2019-10-22 08:55:56,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:56,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:56,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258145322] [2019-10-22 08:55:56,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:56,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:56,244 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2019-10-22 08:55:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:56,406 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2019-10-22 08:55:56,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:56,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-22 08:55:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:56,413 INFO L225 Difference]: With dead ends: 6127 [2019-10-22 08:55:56,414 INFO L226 Difference]: Without dead ends: 6127 [2019-10-22 08:55:56,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-10-22 08:55:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2019-10-22 08:55:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2019-10-22 08:55:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2019-10-22 08:55:56,482 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2019-10-22 08:55:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:56,483 INFO L462 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2019-10-22 08:55:56,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2019-10-22 08:55:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 08:55:56,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:56,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:56,488 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash 587316555, now seen corresponding path program 1 times [2019-10-22 08:55:56,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:56,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706940549] [2019-10-22 08:55:56,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,561 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-22 08:55:56,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706940549] [2019-10-22 08:55:56,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:56,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:55:56,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521676144] [2019-10-22 08:55:56,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:55:56,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:56,563 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 7 states. [2019-10-22 08:55:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:56,932 INFO L93 Difference]: Finished difference Result 6682 states and 15558 transitions. [2019-10-22 08:55:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:55:56,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-22 08:55:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:56,937 INFO L225 Difference]: With dead ends: 6682 [2019-10-22 08:55:56,938 INFO L226 Difference]: Without dead ends: 6627 [2019-10-22 08:55:56,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:55:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2019-10-22 08:55:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 5564. [2019-10-22 08:55:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2019-10-22 08:55:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2019-10-22 08:55:57,010 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2019-10-22 08:55:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:57,010 INFO L462 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2019-10-22 08:55:57,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:55:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2019-10-22 08:55:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 08:55:57,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:57,015 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:57,015 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1550184083, now seen corresponding path program 1 times [2019-10-22 08:55:57,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558675399] [2019-10-22 08:55:57,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,047 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-22 08:55:57,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558675399] [2019-10-22 08:55:57,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:57,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:57,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695086503] [2019-10-22 08:55:57,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:57,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:57,049 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2019-10-22 08:55:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:57,239 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2019-10-22 08:55:57,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:57,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-22 08:55:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:57,247 INFO L225 Difference]: With dead ends: 7293 [2019-10-22 08:55:57,247 INFO L226 Difference]: Without dead ends: 6965 [2019-10-22 08:55:57,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2019-10-22 08:55:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2019-10-22 08:55:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2019-10-22 08:55:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2019-10-22 08:55:57,319 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2019-10-22 08:55:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:57,319 INFO L462 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2019-10-22 08:55:57,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2019-10-22 08:55:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 08:55:57,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:57,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:57,324 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1211555255, now seen corresponding path program 2 times [2019-10-22 08:55:57,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289763155] [2019-10-22 08:55:57,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,395 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-22 08:55:57,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289763155] [2019-10-22 08:55:57,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:57,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:57,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016036265] [2019-10-22 08:55:57,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:57,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:57,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:57,396 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2019-10-22 08:55:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:57,487 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2019-10-22 08:55:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:57,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-22 08:55:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:57,493 INFO L225 Difference]: With dead ends: 6823 [2019-10-22 08:55:57,493 INFO L226 Difference]: Without dead ends: 6823 [2019-10-22 08:55:57,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2019-10-22 08:55:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2019-10-22 08:55:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2019-10-22 08:55:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2019-10-22 08:55:57,552 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2019-10-22 08:55:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:57,552 INFO L462 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2019-10-22 08:55:57,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2019-10-22 08:55:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:55:57,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:57,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:57,558 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1447316239, now seen corresponding path program 1 times [2019-10-22 08:55:57,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35270928] [2019-10-22 08:55:57,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,620 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-22 08:55:57,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35270928] [2019-10-22 08:55:57,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:57,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:57,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268223877] [2019-10-22 08:55:57,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:57,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:57,624 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2019-10-22 08:55:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:57,731 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2019-10-22 08:55:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:57,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 08:55:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:57,737 INFO L225 Difference]: With dead ends: 7324 [2019-10-22 08:55:57,737 INFO L226 Difference]: Without dead ends: 7324 [2019-10-22 08:55:57,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-10-22 08:55:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2019-10-22 08:55:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2019-10-22 08:55:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2019-10-22 08:55:57,793 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2019-10-22 08:55:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:57,793 INFO L462 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2019-10-22 08:55:57,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2019-10-22 08:55:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:55:57,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:57,797 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:57,798 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash -290830271, now seen corresponding path program 1 times [2019-10-22 08:55:57,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403302561] [2019-10-22 08:55:57,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,846 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-22 08:55:57,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403302561] [2019-10-22 08:55:57,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:57,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:57,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158897920] [2019-10-22 08:55:57,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:57,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:57,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:57,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:57,848 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2019-10-22 08:55:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:58,332 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2019-10-22 08:55:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:58,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 08:55:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:58,343 INFO L225 Difference]: With dead ends: 9776 [2019-10-22 08:55:58,343 INFO L226 Difference]: Without dead ends: 9760 [2019-10-22 08:55:58,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2019-10-22 08:55:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2019-10-22 08:55:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2019-10-22 08:55:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2019-10-22 08:55:58,441 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2019-10-22 08:55:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:58,442 INFO L462 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2019-10-22 08:55:58,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2019-10-22 08:55:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:55:58,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:58,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:58,449 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash 953934210, now seen corresponding path program 1 times [2019-10-22 08:55:58,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:58,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278156926] [2019-10-22 08:55:58,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,511 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-22 08:55:58,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278156926] [2019-10-22 08:55:58,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:58,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:58,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585157241] [2019-10-22 08:55:58,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:58,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:58,512 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 5 states. [2019-10-22 08:55:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:58,717 INFO L93 Difference]: Finished difference Result 8563 states and 19548 transitions. [2019-10-22 08:55:58,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:58,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 08:55:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:58,727 INFO L225 Difference]: With dead ends: 8563 [2019-10-22 08:55:58,727 INFO L226 Difference]: Without dead ends: 8563 [2019-10-22 08:55:58,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2019-10-22 08:55:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6604. [2019-10-22 08:55:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6604 states. [2019-10-22 08:55:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 15185 transitions. [2019-10-22 08:55:58,822 INFO L78 Accepts]: Start accepts. Automaton has 6604 states and 15185 transitions. Word has length 92 [2019-10-22 08:55:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:58,823 INFO L462 AbstractCegarLoop]: Abstraction has 6604 states and 15185 transitions. [2019-10-22 08:55:58,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6604 states and 15185 transitions. [2019-10-22 08:55:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:55:58,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:58,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:58,831 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1122170160, now seen corresponding path program 1 times [2019-10-22 08:55:58,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:58,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889066031] [2019-10-22 08:55:58,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,948 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-22 08:55:58,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889066031] [2019-10-22 08:55:58,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:58,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:55:58,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189138964] [2019-10-22 08:55:58,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:55:58,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:55:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:58,949 INFO L87 Difference]: Start difference. First operand 6604 states and 15185 transitions. Second operand 8 states. [2019-10-22 08:55:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:59,318 INFO L93 Difference]: Finished difference Result 10327 states and 23397 transitions. [2019-10-22 08:55:59,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:59,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-10-22 08:55:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:59,325 INFO L225 Difference]: With dead ends: 10327 [2019-10-22 08:55:59,325 INFO L226 Difference]: Without dead ends: 10327 [2019-10-22 08:55:59,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2019-10-22 08:55:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 7449. [2019-10-22 08:55:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7449 states. [2019-10-22 08:55:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 17075 transitions. [2019-10-22 08:55:59,404 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 17075 transitions. Word has length 92 [2019-10-22 08:55:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:59,404 INFO L462 AbstractCegarLoop]: Abstraction has 7449 states and 17075 transitions. [2019-10-22 08:55:59,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:55:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 17075 transitions. [2019-10-22 08:55:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:55:59,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:59,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:59,413 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1843397585, now seen corresponding path program 1 times [2019-10-22 08:55:59,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:59,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691345523] [2019-10-22 08:55:59,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:59,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:59,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:59,537 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-22 08:55:59,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691345523] [2019-10-22 08:55:59,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:59,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:55:59,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819639781] [2019-10-22 08:55:59,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:55:59,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:55:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:59,539 INFO L87 Difference]: Start difference. First operand 7449 states and 17075 transitions. Second operand 9 states. [2019-10-22 08:55:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:59,963 INFO L93 Difference]: Finished difference Result 10727 states and 24485 transitions. [2019-10-22 08:55:59,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:55:59,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-22 08:55:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:59,971 INFO L225 Difference]: With dead ends: 10727 [2019-10-22 08:55:59,971 INFO L226 Difference]: Without dead ends: 10695 [2019-10-22 08:55:59,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:55:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10695 states. [2019-10-22 08:56:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10695 to 9294. [2019-10-22 08:56:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9294 states. [2019-10-22 08:56:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9294 states to 9294 states and 21180 transitions. [2019-10-22 08:56:00,054 INFO L78 Accepts]: Start accepts. Automaton has 9294 states and 21180 transitions. Word has length 92 [2019-10-22 08:56:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:00,055 INFO L462 AbstractCegarLoop]: Abstraction has 9294 states and 21180 transitions. [2019-10-22 08:56:00,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:56:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9294 states and 21180 transitions. [2019-10-22 08:56:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:56:00,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:00,061 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:00,061 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash 46446226, now seen corresponding path program 1 times [2019-10-22 08:56:00,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:00,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336267016] [2019-10-22 08:56:00,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:00,151 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-22 08:56:00,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336267016] [2019-10-22 08:56:00,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:00,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:56:00,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536747057] [2019-10-22 08:56:00,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:56:00,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:00,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:56:00,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:00,152 INFO L87 Difference]: Start difference. First operand 9294 states and 21180 transitions. Second operand 7 states. [2019-10-22 08:56:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:00,297 INFO L93 Difference]: Finished difference Result 12169 states and 28033 transitions. [2019-10-22 08:56:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:00,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-22 08:56:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:00,305 INFO L225 Difference]: With dead ends: 12169 [2019-10-22 08:56:00,305 INFO L226 Difference]: Without dead ends: 12169 [2019-10-22 08:56:00,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12169 states. [2019-10-22 08:56:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12169 to 8443. [2019-10-22 08:56:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8443 states. [2019-10-22 08:56:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8443 states to 8443 states and 19114 transitions. [2019-10-22 08:56:00,386 INFO L78 Accepts]: Start accepts. Automaton has 8443 states and 19114 transitions. Word has length 92 [2019-10-22 08:56:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:00,386 INFO L462 AbstractCegarLoop]: Abstraction has 8443 states and 19114 transitions. [2019-10-22 08:56:00,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:56:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8443 states and 19114 transitions. [2019-10-22 08:56:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 08:56:00,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:00,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:00,392 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash -798025645, now seen corresponding path program 1 times [2019-10-22 08:56:00,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:00,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279522565] [2019-10-22 08:56:00,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:00,436 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-22 08:56:00,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279522565] [2019-10-22 08:56:00,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:00,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:00,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159604815] [2019-10-22 08:56:00,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:00,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:00,437 INFO L87 Difference]: Start difference. First operand 8443 states and 19114 transitions. Second operand 3 states. [2019-10-22 08:56:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:00,467 INFO L93 Difference]: Finished difference Result 8379 states and 18858 transitions. [2019-10-22 08:56:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:00,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 08:56:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:00,476 INFO L225 Difference]: With dead ends: 8379 [2019-10-22 08:56:00,476 INFO L226 Difference]: Without dead ends: 8347 [2019-10-22 08:56:00,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8347 states. [2019-10-22 08:56:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8347 to 6993. [2019-10-22 08:56:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6993 states. [2019-10-22 08:56:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 15658 transitions. [2019-10-22 08:56:00,543 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 15658 transitions. Word has length 92 [2019-10-22 08:56:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:00,543 INFO L462 AbstractCegarLoop]: Abstraction has 6993 states and 15658 transitions. [2019-10-22 08:56:00,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 15658 transitions. [2019-10-22 08:56:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 08:56:00,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:00,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:00,548 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:00,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1670054632, now seen corresponding path program 1 times [2019-10-22 08:56:00,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:00,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178676491] [2019-10-22 08:56:00,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:00,670 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-22 08:56:00,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178676491] [2019-10-22 08:56:00,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:00,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:56:00,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339275198] [2019-10-22 08:56:00,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:56:00,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:00,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:00,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:00,672 INFO L87 Difference]: Start difference. First operand 6993 states and 15658 transitions. Second operand 10 states. [2019-10-22 08:56:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:00,955 INFO L93 Difference]: Finished difference Result 22075 states and 50213 transitions. [2019-10-22 08:56:00,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:56:00,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-22 08:56:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:00,966 INFO L225 Difference]: With dead ends: 22075 [2019-10-22 08:56:00,966 INFO L226 Difference]: Without dead ends: 14847 [2019-10-22 08:56:00,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:56:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14847 states. [2019-10-22 08:56:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14847 to 6855. [2019-10-22 08:56:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6855 states. [2019-10-22 08:56:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6855 states to 6855 states and 15273 transitions. [2019-10-22 08:56:01,052 INFO L78 Accepts]: Start accepts. Automaton has 6855 states and 15273 transitions. Word has length 94 [2019-10-22 08:56:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:01,052 INFO L462 AbstractCegarLoop]: Abstraction has 6855 states and 15273 transitions. [2019-10-22 08:56:01,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:56:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6855 states and 15273 transitions. [2019-10-22 08:56:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 08:56:01,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:01,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:01,057 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1963815528, now seen corresponding path program 2 times [2019-10-22 08:56:01,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:01,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510546749] [2019-10-22 08:56:01,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,130 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:01,130 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:56:01,255 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 08:56:01,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:01 BasicIcfg [2019-10-22 08:56:01,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:01,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:01,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:01,257 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:01,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:32" (3/4) ... [2019-10-22 08:56:01,260 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:56:01,381 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a9db1cf-4f1a-42a3-a0dd-885ecd1a49d1/bin/uautomizer/witness.graphml [2019-10-22 08:56:01,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:01,386 INFO L168 Benchmark]: Toolchain (without parser) took 30262.68 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 940.5 MB in the beginning and 1.4 GB in the end (delta: -453.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-10-22 08:56:01,386 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:01,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:01,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:01,387 INFO L168 Benchmark]: Boogie Preprocessor took 52.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:01,388 INFO L168 Benchmark]: RCFGBuilder took 693.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:01,388 INFO L168 Benchmark]: TraceAbstraction took 28650.63 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -395.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-10-22 08:56:01,388 INFO L168 Benchmark]: Witness Printer took 126.76 ms. Allocated memory is still 3.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:01,390 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 675.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 693.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28650.63 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -395.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 126.76 ms. Allocated memory is still 3.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1443; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1444; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L754] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8406 SDtfs, 8256 SDslu, 18192 SDs, 0 SdLazy, 6069 SolverSat, 395 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 87 SyntacticMatches, 16 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63434occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 84842 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2172 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2048 ConstructedInterpolants, 0 QuantifiedInterpolants, 356439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...