./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.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/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/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 2d4d6eb1ed3fefbef7182528ab233a0014807c05 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-15 23:40:14,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:40:14,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:40:14,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:40:14,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:40:14,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:40:14,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:40:14,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:40:14,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:40:14,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:40:14,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:40:14,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:40:14,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:40:14,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:40:14,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:40:14,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:40:14,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:40:14,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:40:14,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:40:14,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:40:14,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:40:14,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:40:14,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:40:14,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:40:14,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:40:14,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:40:14,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:40:14,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:40:14,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:40:14,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:40:14,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:40:14,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:40:14,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:40:14,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:40:14,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:40:14,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:40:14,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:40:14,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:40:14,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:40:14,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:40:14,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:40:14,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:40:15,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:40:15,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:40:15,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:40:15,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:40:15,007 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:40:15,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:40:15,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:40:15,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:40:15,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:40:15,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:40:15,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:40:15,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:40:15,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:40:15,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:40:15,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:40:15,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:40:15,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:40:15,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:40:15,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:40:15,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:40:15,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:40:15,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:40:15,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:40:15,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:40:15,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:40:15,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:40:15,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:40:15,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:40:15,014 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/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/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 -> 2d4d6eb1ed3fefbef7182528ab233a0014807c05 [2019-11-15 23:40:15,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:40:15,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:40:15,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:40:15,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:40:15,076 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:40:15,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i [2019-11-15 23:40:15,123 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/data/37b2343b5/e58fda5e86054bc08bb8a6d78f28fb1d/FLAGb54c715af [2019-11-15 23:40:15,603 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:40:15,604 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc.i [2019-11-15 23:40:15,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/data/37b2343b5/e58fda5e86054bc08bb8a6d78f28fb1d/FLAGb54c715af [2019-11-15 23:40:15,631 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/data/37b2343b5/e58fda5e86054bc08bb8a6d78f28fb1d [2019-11-15 23:40:15,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:40:15,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:40:15,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:40:15,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:40:15,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:40:15,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:40:15" (1/1) ... [2019-11-15 23:40:15,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8016c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:15, skipping insertion in model container [2019-11-15 23:40:15,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:40:15" (1/1) ... [2019-11-15 23:40:15,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:40:15,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:40:16,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:40:16,143 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:40:16,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:40:16,274 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:40:16,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16 WrapperNode [2019-11-15 23:40:16,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:40:16,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:40:16,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:40:16,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:40:16,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:40:16,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:40:16,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:40:16,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:40:16,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... [2019-11-15 23:40:16,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:40:16,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:40:16,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:40:16,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:40:16,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/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-11-15 23:40:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:40:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:40:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:40:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:40:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:40:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:40:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:40:16,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:40:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:40:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:40:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:40:16,444 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:40:17,068 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:40:17,068 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:40:17,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:40:17 BoogieIcfgContainer [2019-11-15 23:40:17,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:40:17,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:40:17,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:40:17,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:40:17,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:40:15" (1/3) ... [2019-11-15 23:40:17,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c90e0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:40:17, skipping insertion in model container [2019-11-15 23:40:17,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:40:16" (2/3) ... [2019-11-15 23:40:17,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c90e0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:40:17, skipping insertion in model container [2019-11-15 23:40:17,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:40:17" (3/3) ... [2019-11-15 23:40:17,078 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc.i [2019-11-15 23:40:17,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,114 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,114 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,115 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,115 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,115 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,115 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,116 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,116 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,116 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,116 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,116 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,117 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,118 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,119 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,120 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,122 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,122 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:40:17,151 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:40:17,151 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:40:17,157 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:40:17,167 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:40:17,183 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:40:17,184 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:40:17,184 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:40:17,184 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:40:17,184 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:40:17,184 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:40:17,184 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:40:17,184 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:40:17,195 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-15 23:40:19,513 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-11-15 23:40:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-11-15 23:40:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:40:19,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:19,523 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] [2019-11-15 23:40:19,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:19,529 INFO L82 PathProgramCache]: Analyzing trace with hash -120544767, now seen corresponding path program 1 times [2019-11-15 23:40:19,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:19,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405556852] [2019-11-15 23:40:19,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:19,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:19,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:19,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405556852] [2019-11-15 23:40:19,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:19,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:19,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480085007] [2019-11-15 23:40:19,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:19,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:19,793 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-11-15 23:40:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:20,665 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-11-15 23:40:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:20,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 23:40:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:20,918 INFO L225 Difference]: With dead ends: 33591 [2019-11-15 23:40:20,919 INFO L226 Difference]: Without dead ends: 25703 [2019-11-15 23:40:20,920 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-11-15 23:40:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-11-15 23:40:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-11-15 23:40:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-11-15 23:40:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-11-15 23:40:22,392 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-11-15 23:40:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:22,393 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-11-15 23:40:22,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-11-15 23:40:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:40:22,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:22,406 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] [2019-11-15 23:40:22,406 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:22,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1401012243, now seen corresponding path program 1 times [2019-11-15 23:40:22,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:22,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744314546] [2019-11-15 23:40:22,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:22,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:22,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:22,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744314546] [2019-11-15 23:40:22,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:22,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:40:22,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348939684] [2019-11-15 23:40:22,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:22,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:22,584 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-11-15 23:40:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:23,631 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-11-15 23:40:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:40:23,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 23:40:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:23,795 INFO L225 Difference]: With dead ends: 41081 [2019-11-15 23:40:23,795 INFO L226 Difference]: Without dead ends: 40545 [2019-11-15 23:40:23,796 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-11-15 23:40:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-11-15 23:40:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-11-15 23:40:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-11-15 23:40:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-11-15 23:40:25,372 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-11-15 23:40:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:25,382 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-11-15 23:40:25,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-11-15 23:40:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:40:25,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:25,390 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-11-15 23:40:25,391 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:25,391 INFO L82 PathProgramCache]: Analyzing trace with hash -168847436, now seen corresponding path program 1 times [2019-11-15 23:40:25,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:25,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058658018] [2019-11-15 23:40:25,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:25,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:25,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:25,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058658018] [2019-11-15 23:40:25,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:25,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:40:25,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350584507] [2019-11-15 23:40:25,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:25,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:25,514 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-11-15 23:40:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:26,537 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-11-15 23:40:26,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:40:26,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:40:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:26,735 INFO L225 Difference]: With dead ends: 49778 [2019-11-15 23:40:26,736 INFO L226 Difference]: Without dead ends: 49274 [2019-11-15 23:40:26,736 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-11-15 23:40:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-11-15 23:40:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-11-15 23:40:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-11-15 23:40:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-11-15 23:40:27,970 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-11-15 23:40:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:27,971 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-11-15 23:40:27,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-11-15 23:40:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:40:27,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:27,980 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] [2019-11-15 23:40:27,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1917601690, now seen corresponding path program 1 times [2019-11-15 23:40:27,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:27,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600767411] [2019-11-15 23:40:27,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:28,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600767411] [2019-11-15 23:40:28,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:28,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:28,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60636099] [2019-11-15 23:40:28,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:28,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:28,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:28,018 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-11-15 23:40:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:28,878 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-11-15 23:40:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:28,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:40:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:29,091 INFO L225 Difference]: With dead ends: 61087 [2019-11-15 23:40:29,092 INFO L226 Difference]: Without dead ends: 61087 [2019-11-15 23:40:29,092 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-11-15 23:40:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-11-15 23:40:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-11-15 23:40:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-11-15 23:40:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-11-15 23:40:30,157 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-11-15 23:40:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:30,157 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-11-15 23:40:30,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-11-15 23:40:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:40:30,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:30,171 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] [2019-11-15 23:40:30,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash -740471995, now seen corresponding path program 1 times [2019-11-15 23:40:30,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:30,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646063472] [2019-11-15 23:40:30,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:30,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:30,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646063472] [2019-11-15 23:40:30,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:30,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:40:30,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10913298] [2019-11-15 23:40:30,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:40:30,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:40:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:40:30,308 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-11-15 23:40:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:31,486 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-11-15 23:40:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:40:31,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:40:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:31,627 INFO L225 Difference]: With dead ends: 63756 [2019-11-15 23:40:31,627 INFO L226 Difference]: Without dead ends: 63756 [2019-11-15 23:40:31,627 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-11-15 23:40:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-11-15 23:40:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-11-15 23:40:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-11-15 23:40:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-11-15 23:40:32,706 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-11-15 23:40:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:32,707 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-11-15 23:40:32,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:40:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-11-15 23:40:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:40:32,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:32,723 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] [2019-11-15 23:40:32,724 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1757543942, now seen corresponding path program 1 times [2019-11-15 23:40:32,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:32,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780882110] [2019-11-15 23:40:32,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:32,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:32,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:32,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780882110] [2019-11-15 23:40:32,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:32,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:40:32,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889304366] [2019-11-15 23:40:32,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:40:32,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:32,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:40:32,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:40:32,820 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-11-15 23:40:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:34,296 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-11-15 23:40:34,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:34,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 23:40:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:34,461 INFO L225 Difference]: With dead ends: 83685 [2019-11-15 23:40:34,461 INFO L226 Difference]: Without dead ends: 83685 [2019-11-15 23:40:34,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:40:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-11-15 23:40:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-11-15 23:40:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-11-15 23:40:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-11-15 23:40:35,725 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-11-15 23:40:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:35,726 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-11-15 23:40:35,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:40:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-11-15 23:40:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:40:35,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:35,739 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] [2019-11-15 23:40:35,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1649919673, now seen corresponding path program 1 times [2019-11-15 23:40:35,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:35,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994156255] [2019-11-15 23:40:35,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:35,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:35,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:35,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994156255] [2019-11-15 23:40:35,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:35,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:35,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598535386] [2019-11-15 23:40:35,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:35,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:35,800 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-11-15 23:40:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:36,421 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-11-15 23:40:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:36,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 23:40:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:36,513 INFO L225 Difference]: With dead ends: 54021 [2019-11-15 23:40:36,513 INFO L226 Difference]: Without dead ends: 54021 [2019-11-15 23:40:36,513 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-11-15 23:40:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-11-15 23:40:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-11-15 23:40:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-11-15 23:40:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-11-15 23:40:37,362 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-11-15 23:40:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:37,362 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-11-15 23:40:37,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-11-15 23:40:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:40:37,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:37,373 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] [2019-11-15 23:40:37,373 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:37,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:37,374 INFO L82 PathProgramCache]: Analyzing trace with hash -796322971, now seen corresponding path program 1 times [2019-11-15 23:40:37,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:37,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273639372] [2019-11-15 23:40:37,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:37,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:37,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:37,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273639372] [2019-11-15 23:40:37,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:37,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:40:37,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060064229] [2019-11-15 23:40:37,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:40:37,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:40:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:40:37,446 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-11-15 23:40:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:38,181 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-11-15 23:40:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:40:38,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:40:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:38,314 INFO L225 Difference]: With dead ends: 68646 [2019-11-15 23:40:38,314 INFO L226 Difference]: Without dead ends: 68078 [2019-11-15 23:40:38,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:40:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-11-15 23:40:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-11-15 23:40:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-11-15 23:40:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-11-15 23:40:39,376 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-11-15 23:40:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:39,377 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-11-15 23:40:39,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:40:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-11-15 23:40:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:40:39,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:39,389 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] [2019-11-15 23:40:39,390 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1612850747, now seen corresponding path program 1 times [2019-11-15 23:40:39,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:39,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61794741] [2019-11-15 23:40:39,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:39,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:39,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:40,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61794741] [2019-11-15 23:40:40,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:40,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:40:40,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485583964] [2019-11-15 23:40:40,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:40:40,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:40,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:40:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:40:40,009 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-11-15 23:40:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:40,825 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-11-15 23:40:40,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:40:40,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:40:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:40,956 INFO L225 Difference]: With dead ends: 67849 [2019-11-15 23:40:40,956 INFO L226 Difference]: Without dead ends: 67849 [2019-11-15 23:40:40,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:40:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-11-15 23:40:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-11-15 23:40:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-11-15 23:40:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-11-15 23:40:42,044 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-11-15 23:40:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:42,044 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-11-15 23:40:42,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:40:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-11-15 23:40:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:40:42,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:42,054 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] [2019-11-15 23:40:42,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1794612868, now seen corresponding path program 1 times [2019-11-15 23:40:42,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:42,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956521449] [2019-11-15 23:40:42,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:42,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956521449] [2019-11-15 23:40:42,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:42,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:42,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130611151] [2019-11-15 23:40:42,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:42,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:42,123 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-11-15 23:40:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:42,166 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-11-15 23:40:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:40:42,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 23:40:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:42,177 INFO L225 Difference]: With dead ends: 10212 [2019-11-15 23:40:42,177 INFO L226 Difference]: Without dead ends: 8507 [2019-11-15 23:40:42,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-15 23:40:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-11-15 23:40:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-11-15 23:40:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-11-15 23:40:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-11-15 23:40:42,276 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-11-15 23:40:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:42,276 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-11-15 23:40:42,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-11-15 23:40:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:40:42,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:42,279 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] [2019-11-15 23:40:42,279 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 458880321, now seen corresponding path program 1 times [2019-11-15 23:40:42,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:42,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811875457] [2019-11-15 23:40:42,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:42,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811875457] [2019-11-15 23:40:42,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:42,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:42,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725594766] [2019-11-15 23:40:42,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:42,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:42,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:42,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:42,330 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-11-15 23:40:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:42,456 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-11-15 23:40:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:40:42,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 23:40:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:42,472 INFO L225 Difference]: With dead ends: 9706 [2019-11-15 23:40:42,473 INFO L226 Difference]: Without dead ends: 9706 [2019-11-15 23:40:42,473 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-11-15 23:40:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-11-15 23:40:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-11-15 23:40:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-11-15 23:40:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-11-15 23:40:42,587 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-11-15 23:40:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:42,588 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-11-15 23:40:42,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-11-15 23:40:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:40:42,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:42,591 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] [2019-11-15 23:40:42,591 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2093276640, now seen corresponding path program 1 times [2019-11-15 23:40:42,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:42,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78784666] [2019-11-15 23:40:42,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:42,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78784666] [2019-11-15 23:40:42,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:42,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:40:42,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549441469] [2019-11-15 23:40:42,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:40:42,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:42,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:40:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:40:42,666 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-11-15 23:40:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:43,099 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-11-15 23:40:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:40:43,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 23:40:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:43,112 INFO L225 Difference]: With dead ends: 11195 [2019-11-15 23:40:43,113 INFO L226 Difference]: Without dead ends: 11134 [2019-11-15 23:40:43,113 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-11-15 23:40:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-11-15 23:40:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-11-15 23:40:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-11-15 23:40:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-11-15 23:40:43,241 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-11-15 23:40:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:43,241 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-11-15 23:40:43,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:40:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-11-15 23:40:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:40:43,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:43,246 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] [2019-11-15 23:40:43,247 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:43,247 INFO L82 PathProgramCache]: Analyzing trace with hash -650639436, now seen corresponding path program 1 times [2019-11-15 23:40:43,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:43,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922725491] [2019-11-15 23:40:43,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:43,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:43,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:43,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922725491] [2019-11-15 23:40:43,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:43,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:43,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447147453] [2019-11-15 23:40:43,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:43,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:43,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:43,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:43,290 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states. [2019-11-15 23:40:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:43,705 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-11-15 23:40:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:40:43,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 23:40:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:43,729 INFO L225 Difference]: With dead ends: 15178 [2019-11-15 23:40:43,729 INFO L226 Difference]: Without dead ends: 15178 [2019-11-15 23:40:43,729 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-11-15 23:40:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-11-15 23:40:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-11-15 23:40:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-11-15 23:40:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-11-15 23:40:44,038 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-11-15 23:40:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:44,038 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-11-15 23:40:44,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-11-15 23:40:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:40:44,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:44,051 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] [2019-11-15 23:40:44,051 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -717646189, now seen corresponding path program 1 times [2019-11-15 23:40:44,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:44,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79594487] [2019-11-15 23:40:44,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:44,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79594487] [2019-11-15 23:40:44,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:44,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:40:44,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406822250] [2019-11-15 23:40:44,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:40:44,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:44,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:40:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:40:44,173 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states. [2019-11-15 23:40:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:44,516 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-11-15 23:40:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:44,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:40:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:44,531 INFO L225 Difference]: With dead ends: 12772 [2019-11-15 23:40:44,531 INFO L226 Difference]: Without dead ends: 12772 [2019-11-15 23:40:44,531 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-11-15 23:40:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-11-15 23:40:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-11-15 23:40:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-11-15 23:40:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-11-15 23:40:44,674 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-11-15 23:40:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:44,675 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-11-15 23:40:44,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:40:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-11-15 23:40:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:40:44,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:44,682 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] [2019-11-15 23:40:44,682 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1539264818, now seen corresponding path program 1 times [2019-11-15 23:40:44,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:44,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519598466] [2019-11-15 23:40:44,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:44,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519598466] [2019-11-15 23:40:44,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:44,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:40:44,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523481300] [2019-11-15 23:40:44,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:44,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:44,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:44,759 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states. [2019-11-15 23:40:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:45,149 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-11-15 23:40:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:40:45,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:40:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:45,174 INFO L225 Difference]: With dead ends: 15220 [2019-11-15 23:40:45,174 INFO L226 Difference]: Without dead ends: 15220 [2019-11-15 23:40:45,176 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-11-15 23:40:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-11-15 23:40:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-11-15 23:40:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-11-15 23:40:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-11-15 23:40:45,403 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-11-15 23:40:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:45,403 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-11-15 23:40:45,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-11-15 23:40:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:40:45,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:45,410 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] [2019-11-15 23:40:45,410 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1028730641, now seen corresponding path program 1 times [2019-11-15 23:40:45,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:45,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104988486] [2019-11-15 23:40:45,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:45,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:45,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:45,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104988486] [2019-11-15 23:40:45,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:45,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:40:45,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514004258] [2019-11-15 23:40:45,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:40:45,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:45,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:40:45,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:40:45,509 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 6 states. [2019-11-15 23:40:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:45,682 INFO L93 Difference]: Finished difference Result 14534 states and 40657 transitions. [2019-11-15 23:40:45,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:40:45,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:40:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:45,704 INFO L225 Difference]: With dead ends: 14534 [2019-11-15 23:40:45,704 INFO L226 Difference]: Without dead ends: 14534 [2019-11-15 23:40:45,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-15 23:40:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2019-11-15 23:40:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 13450. [2019-11-15 23:40:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13450 states. [2019-11-15 23:40:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13450 states to 13450 states and 37711 transitions. [2019-11-15 23:40:45,921 INFO L78 Accepts]: Start accepts. Automaton has 13450 states and 37711 transitions. Word has length 67 [2019-11-15 23:40:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:45,922 INFO L462 AbstractCegarLoop]: Abstraction has 13450 states and 37711 transitions. [2019-11-15 23:40:45,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:40:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 13450 states and 37711 transitions. [2019-11-15 23:40:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:40:45,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:45,933 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] [2019-11-15 23:40:45,933 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash 119282963, now seen corresponding path program 1 times [2019-11-15 23:40:45,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:45,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701730591] [2019-11-15 23:40:45,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:45,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:46,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701730591] [2019-11-15 23:40:46,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:46,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:40:46,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834849155] [2019-11-15 23:40:46,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:46,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:46,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:46,022 INFO L87 Difference]: Start difference. First operand 13450 states and 37711 transitions. Second operand 5 states. [2019-11-15 23:40:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:46,071 INFO L93 Difference]: Finished difference Result 4249 states and 10316 transitions. [2019-11-15 23:40:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:40:46,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:40:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:46,074 INFO L225 Difference]: With dead ends: 4249 [2019-11-15 23:40:46,075 INFO L226 Difference]: Without dead ends: 3586 [2019-11-15 23:40:46,075 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-11-15 23:40:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2019-11-15 23:40:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3504. [2019-11-15 23:40:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3504 states. [2019-11-15 23:40:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 8202 transitions. [2019-11-15 23:40:46,105 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 8202 transitions. Word has length 67 [2019-11-15 23:40:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:46,106 INFO L462 AbstractCegarLoop]: Abstraction has 3504 states and 8202 transitions. [2019-11-15 23:40:46,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 8202 transitions. [2019-11-15 23:40:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:40:46,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:46,108 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] [2019-11-15 23:40:46,108 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -355085295, now seen corresponding path program 1 times [2019-11-15 23:40:46,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:46,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335735904] [2019-11-15 23:40:46,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:46,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335735904] [2019-11-15 23:40:46,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:46,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:46,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207956990] [2019-11-15 23:40:46,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:46,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:46,135 INFO L87 Difference]: Start difference. First operand 3504 states and 8202 transitions. Second operand 3 states. [2019-11-15 23:40:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:46,168 INFO L93 Difference]: Finished difference Result 4255 states and 9774 transitions. [2019-11-15 23:40:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:46,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 23:40:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:46,173 INFO L225 Difference]: With dead ends: 4255 [2019-11-15 23:40:46,174 INFO L226 Difference]: Without dead ends: 4255 [2019-11-15 23:40:46,174 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-11-15 23:40:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-11-15 23:40:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3447. [2019-11-15 23:40:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3447 states. [2019-11-15 23:40:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 7860 transitions. [2019-11-15 23:40:46,223 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 7860 transitions. Word has length 67 [2019-11-15 23:40:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:46,223 INFO L462 AbstractCegarLoop]: Abstraction has 3447 states and 7860 transitions. [2019-11-15 23:40:46,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 7860 transitions. [2019-11-15 23:40:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:40:46,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:46,227 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] [2019-11-15 23:40:46,227 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:46,228 INFO L82 PathProgramCache]: Analyzing trace with hash 480748516, now seen corresponding path program 1 times [2019-11-15 23:40:46,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:46,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841541264] [2019-11-15 23:40:46,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:46,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841541264] [2019-11-15 23:40:46,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:46,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:40:46,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440472198] [2019-11-15 23:40:46,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:46,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:46,286 INFO L87 Difference]: Start difference. First operand 3447 states and 7860 transitions. Second operand 5 states. [2019-11-15 23:40:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:46,442 INFO L93 Difference]: Finished difference Result 4330 states and 9908 transitions. [2019-11-15 23:40:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:46,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-15 23:40:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:46,446 INFO L225 Difference]: With dead ends: 4330 [2019-11-15 23:40:46,446 INFO L226 Difference]: Without dead ends: 4330 [2019-11-15 23:40:46,447 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-11-15 23:40:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2019-11-15 23:40:46,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3794. [2019-11-15 23:40:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-11-15 23:40:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 8670 transitions. [2019-11-15 23:40:46,482 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 8670 transitions. Word has length 73 [2019-11-15 23:40:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:46,482 INFO L462 AbstractCegarLoop]: Abstraction has 3794 states and 8670 transitions. [2019-11-15 23:40:46,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 8670 transitions. [2019-11-15 23:40:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:40:46,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:46,485 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] [2019-11-15 23:40:46,485 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2071408445, now seen corresponding path program 1 times [2019-11-15 23:40:46,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:46,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616574007] [2019-11-15 23:40:46,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:46,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616574007] [2019-11-15 23:40:46,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:46,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:40:46,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884021258] [2019-11-15 23:40:46,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:40:46,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:40:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:40:46,560 INFO L87 Difference]: Start difference. First operand 3794 states and 8670 transitions. Second operand 7 states. [2019-11-15 23:40:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:46,961 INFO L93 Difference]: Finished difference Result 4457 states and 10042 transitions. [2019-11-15 23:40:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:40:46,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 23:40:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:46,965 INFO L225 Difference]: With dead ends: 4457 [2019-11-15 23:40:46,965 INFO L226 Difference]: Without dead ends: 4404 [2019-11-15 23:40:46,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:40:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2019-11-15 23:40:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 3840. [2019-11-15 23:40:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2019-11-15 23:40:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 8675 transitions. [2019-11-15 23:40:47,000 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 8675 transitions. Word has length 73 [2019-11-15 23:40:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:47,001 INFO L462 AbstractCegarLoop]: Abstraction has 3840 states and 8675 transitions. [2019-11-15 23:40:47,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:40:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 8675 transitions. [2019-11-15 23:40:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:40:47,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:47,006 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-11-15 23:40:47,006 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2088918372, now seen corresponding path program 1 times [2019-11-15 23:40:47,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:47,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477270930] [2019-11-15 23:40:47,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:47,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-11-15 23:40:47,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477270930] [2019-11-15 23:40:47,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:47,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:47,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041169734] [2019-11-15 23:40:47,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:47,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:47,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:47,053 INFO L87 Difference]: Start difference. First operand 3840 states and 8675 transitions. Second operand 3 states. [2019-11-15 23:40:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:47,180 INFO L93 Difference]: Finished difference Result 5383 states and 11868 transitions. [2019-11-15 23:40:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:47,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 23:40:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:47,184 INFO L225 Difference]: With dead ends: 5383 [2019-11-15 23:40:47,184 INFO L226 Difference]: Without dead ends: 5092 [2019-11-15 23:40:47,184 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-11-15 23:40:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2019-11-15 23:40:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4632. [2019-11-15 23:40:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 23:40:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 10340 transitions. [2019-11-15 23:40:47,225 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 10340 transitions. Word has length 94 [2019-11-15 23:40:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:47,226 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 10340 transitions. [2019-11-15 23:40:47,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 10340 transitions. [2019-11-15 23:40:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:40:47,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:47,230 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-11-15 23:40:47,230 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1922898460, now seen corresponding path program 1 times [2019-11-15 23:40:47,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:47,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971853178] [2019-11-15 23:40:47,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:47,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971853178] [2019-11-15 23:40:47,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:47,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:47,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128641371] [2019-11-15 23:40:47,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:47,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:47,298 INFO L87 Difference]: Start difference. First operand 4632 states and 10340 transitions. Second operand 4 states. [2019-11-15 23:40:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:47,381 INFO L93 Difference]: Finished difference Result 4834 states and 10823 transitions. [2019-11-15 23:40:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:47,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 23:40:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:47,385 INFO L225 Difference]: With dead ends: 4834 [2019-11-15 23:40:47,385 INFO L226 Difference]: Without dead ends: 4834 [2019-11-15 23:40:47,386 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-11-15 23:40:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2019-11-15 23:40:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4318. [2019-11-15 23:40:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4318 states. [2019-11-15 23:40:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 9721 transitions. [2019-11-15 23:40:47,426 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 9721 transitions. Word has length 94 [2019-11-15 23:40:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:47,426 INFO L462 AbstractCegarLoop]: Abstraction has 4318 states and 9721 transitions. [2019-11-15 23:40:47,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 9721 transitions. [2019-11-15 23:40:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:47,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:47,429 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, 1, 1] [2019-11-15 23:40:47,430 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1119221174, now seen corresponding path program 1 times [2019-11-15 23:40:47,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:47,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485421199] [2019-11-15 23:40:47,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:47,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485421199] [2019-11-15 23:40:47,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:47,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:40:47,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994801783] [2019-11-15 23:40:47,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:40:47,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:40:47,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:40:47,496 INFO L87 Difference]: Start difference. First operand 4318 states and 9721 transitions. Second operand 5 states. [2019-11-15 23:40:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:47,594 INFO L93 Difference]: Finished difference Result 4883 states and 10964 transitions. [2019-11-15 23:40:47,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:40:47,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 23:40:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:47,598 INFO L225 Difference]: With dead ends: 4883 [2019-11-15 23:40:47,598 INFO L226 Difference]: Without dead ends: 4883 [2019-11-15 23:40:47,598 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-11-15 23:40:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-11-15 23:40:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3736. [2019-11-15 23:40:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3736 states. [2019-11-15 23:40:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 8382 transitions. [2019-11-15 23:40:47,633 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 8382 transitions. Word has length 96 [2019-11-15 23:40:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:47,634 INFO L462 AbstractCegarLoop]: Abstraction has 3736 states and 8382 transitions. [2019-11-15 23:40:47,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:40:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 8382 transitions. [2019-11-15 23:40:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:47,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:47,638 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, 1, 1] [2019-11-15 23:40:47,639 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:47,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1107905047, now seen corresponding path program 1 times [2019-11-15 23:40:47,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:47,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316106396] [2019-11-15 23:40:47,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:47,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316106396] [2019-11-15 23:40:47,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:47,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:47,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032143543] [2019-11-15 23:40:47,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:47,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:47,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:47,717 INFO L87 Difference]: Start difference. First operand 3736 states and 8382 transitions. Second operand 4 states. [2019-11-15 23:40:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:47,912 INFO L93 Difference]: Finished difference Result 4375 states and 9785 transitions. [2019-11-15 23:40:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:40:47,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:40:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:47,916 INFO L225 Difference]: With dead ends: 4375 [2019-11-15 23:40:47,916 INFO L226 Difference]: Without dead ends: 4337 [2019-11-15 23:40:47,916 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-11-15 23:40:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-11-15 23:40:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 4159. [2019-11-15 23:40:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4159 states. [2019-11-15 23:40:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4159 states to 4159 states and 9314 transitions. [2019-11-15 23:40:47,953 INFO L78 Accepts]: Start accepts. Automaton has 4159 states and 9314 transitions. Word has length 96 [2019-11-15 23:40:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:47,953 INFO L462 AbstractCegarLoop]: Abstraction has 4159 states and 9314 transitions. [2019-11-15 23:40:47,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4159 states and 9314 transitions. [2019-11-15 23:40:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:47,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:47,956 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, 1, 1] [2019-11-15 23:40:47,956 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:47,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1109852906, now seen corresponding path program 1 times [2019-11-15 23:40:47,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:47,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653309136] [2019-11-15 23:40:47,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:48,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653309136] [2019-11-15 23:40:48,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:48,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:40:48,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76984432] [2019-11-15 23:40:48,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:48,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:48,125 INFO L87 Difference]: Start difference. First operand 4159 states and 9314 transitions. Second operand 9 states. [2019-11-15 23:40:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:48,652 INFO L93 Difference]: Finished difference Result 5943 states and 13100 transitions. [2019-11-15 23:40:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:40:48,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 23:40:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:48,656 INFO L225 Difference]: With dead ends: 5943 [2019-11-15 23:40:48,656 INFO L226 Difference]: Without dead ends: 5943 [2019-11-15 23:40:48,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:40:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2019-11-15 23:40:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 4833. [2019-11-15 23:40:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-11-15 23:40:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 10815 transitions. [2019-11-15 23:40:48,703 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 10815 transitions. Word has length 96 [2019-11-15 23:40:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:48,703 INFO L462 AbstractCegarLoop]: Abstraction has 4833 states and 10815 transitions. [2019-11-15 23:40:48,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 10815 transitions. [2019-11-15 23:40:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:48,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:48,707 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, 1, 1] [2019-11-15 23:40:48,707 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203819, now seen corresponding path program 1 times [2019-11-15 23:40:48,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:48,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200318873] [2019-11-15 23:40:48,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:48,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:48,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:48,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200318873] [2019-11-15 23:40:48,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:48,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:40:48,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793206198] [2019-11-15 23:40:48,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:40:48,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:40:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:40:48,888 INFO L87 Difference]: Start difference. First operand 4833 states and 10815 transitions. Second operand 10 states. [2019-11-15 23:40:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:49,415 INFO L93 Difference]: Finished difference Result 18851 states and 42613 transitions. [2019-11-15 23:40:49,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:40:49,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-15 23:40:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:49,424 INFO L225 Difference]: With dead ends: 18851 [2019-11-15 23:40:49,424 INFO L226 Difference]: Without dead ends: 10559 [2019-11-15 23:40:49,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:40:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-15 23:40:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 4565. [2019-11-15 23:40:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-15 23:40:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 10095 transitions. [2019-11-15 23:40:49,488 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 10095 transitions. Word has length 96 [2019-11-15 23:40:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:49,488 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 10095 transitions. [2019-11-15 23:40:49,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:40:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 10095 transitions. [2019-11-15 23:40:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:49,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:49,493 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, 1, 1] [2019-11-15 23:40:49,493 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 500491279, now seen corresponding path program 2 times [2019-11-15 23:40:49,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:49,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384946326] [2019-11-15 23:40:49,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:49,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:49,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:40:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:40:49,574 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:40:49,575 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:40:49,756 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:40:49,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:40:49 BasicIcfg [2019-11-15 23:40:49,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:40:49,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:40:49,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:40:49,760 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:40:49,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:40:17" (3/4) ... [2019-11-15 23:40:49,768 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:40:49,893 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_603fa111-0142-490b-8f30-a64a0cf4c733/bin/uautomizer/witness.graphml [2019-11-15 23:40:49,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:40:49,895 INFO L168 Benchmark]: Toolchain (without parser) took 34260.18 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 942.0 MB in the beginning and 1.5 GB in the end (delta: -553.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 23:40:49,896 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:40:49,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:49,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.10 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-11-15 23:40:49,897 INFO L168 Benchmark]: Boogie Preprocessor took 34.92 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-11-15 23:40:49,897 INFO L168 Benchmark]: RCFGBuilder took 707.99 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.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:49,898 INFO L168 Benchmark]: TraceAbstraction took 32689.81 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -496.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:40:49,898 INFO L168 Benchmark]: Witness Printer took 133.72 ms. Allocated memory is still 3.9 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:49,900 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 639.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.10 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 34.92 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 707.99 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.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32689.81 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -496.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 133.72 ms. Allocated memory is still 3.9 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 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] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L801] 0 pthread_t t1609; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L803] 0 pthread_t t1610; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L731] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L732] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L733] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L734] 1 x$r_buff0_thd1 = (_Bool)1 [L737] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] FCALL, FORK 0 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L772] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] 2 x = x$flush_delayed ? x$mem_tmp : x [L776] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L814] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 3 error locations. Result: UNSAFE, OverallTime: 32.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7359 SDtfs, 7864 SDslu, 16753 SDs, 0 SdLazy, 5769 SolverSat, 372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 71 SyntacticMatches, 11 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 81179 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1834 NumberOfCodeBlocks, 1834 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1712 ConstructedInterpolants, 0 QuantifiedInterpolants, 323026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...