./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/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 5d2cd970f76a76b84bde79762c11ce7e22c69784 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:11:52,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:52,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:52,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:52,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:52,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:52,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:52,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:52,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:52,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:52,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:52,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:52,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:52,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:52,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:52,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:52,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:52,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:52,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:52,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:52,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:52,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:52,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:52,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:52,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:52,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:52,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:52,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:52,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:52,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:52,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:52,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:52,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:52,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:52,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:52,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:52,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:52,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:52,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:52,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:52,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:52,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:11:52,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:52,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:52,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:52,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:52,188 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:52,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:52,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:11:52,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:11:52,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:11:52,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:52,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:11:52,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:11:52,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:11:52,190 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:11:52,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:11:52,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:52,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:11:52,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:52,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:52,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:11:52,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:11:52,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:11:52,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:52,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:11:52,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:11:52,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:11:52,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:11:52,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:11:52,194 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_9ed1ef8a-dd6a-4c4d-a111-c980af091218/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 -> 5d2cd970f76a76b84bde79762c11ce7e22c69784 [2019-11-16 00:11:52,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:52,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:52,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:52,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:52,235 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:52,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-11-16 00:11:52,287 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/data/48e1d0b9a/df529ef277a242ef9fea57778e195224/FLAG40177cc18 [2019-11-16 00:11:52,729 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:52,730 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-11-16 00:11:52,744 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/data/48e1d0b9a/df529ef277a242ef9fea57778e195224/FLAG40177cc18 [2019-11-16 00:11:53,027 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/data/48e1d0b9a/df529ef277a242ef9fea57778e195224 [2019-11-16 00:11:53,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:53,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:11:53,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:53,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:53,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:53,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2785b9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53, skipping insertion in model container [2019-11-16 00:11:53,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,042 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:53,111 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:53,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:53,562 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:53,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:53,681 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:53,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53 WrapperNode [2019-11-16 00:11:53,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:53,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:53,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:11:53,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:11:53,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:53,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:53,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:53,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:53,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:53,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:53,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:53,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:53,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/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-16 00:11:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:11:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:11:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:11:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:11:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:11:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:11:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:11:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:11:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:11:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:53,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:53,845 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:11:54,491 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:54,491 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:11:54,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:54 BoogieIcfgContainer [2019-11-16 00:11:54,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:54,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:11:54,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:11:54,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:11:54,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:53" (1/3) ... [2019-11-16 00:11:54,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a3840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:54, skipping insertion in model container [2019-11-16 00:11:54,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (2/3) ... [2019-11-16 00:11:54,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a3840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:54, skipping insertion in model container [2019-11-16 00:11:54,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:54" (3/3) ... [2019-11-16 00:11:54,500 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i [2019-11-16 00:11:54,563 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,564 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,564 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,565 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,565 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,565 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,565 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,566 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,566 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,566 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,566 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,566 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,567 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,567 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,567 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,567 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,568 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,568 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,568 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,568 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,568 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,569 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,569 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,569 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,570 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,570 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,570 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,570 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,570 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,571 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,571 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,571 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,571 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,572 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,572 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,572 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,572 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,572 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,573 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,573 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,574 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,574 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,574 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,574 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,575 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,576 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,576 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,576 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,576 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,577 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,577 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,577 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,577 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,577 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,578 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,578 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,578 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,579 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,579 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,579 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,579 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,580 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,580 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,580 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,580 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,580 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,581 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,582 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,582 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,582 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,582 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,582 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,583 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,583 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,583 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,583 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,584 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,584 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,584 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,584 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,586 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,586 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,586 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,586 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,590 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,590 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,590 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,591 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,593 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,617 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:11:54,617 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:11:54,627 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:11:54,636 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:11:54,656 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:11:54,656 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:11:54,656 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:11:54,656 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:54,657 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:54,657 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:11:54,657 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:54,657 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:11:54,672 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 164 transitions [2019-11-16 00:11:56,489 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25978 states. [2019-11-16 00:11:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 25978 states. [2019-11-16 00:11:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:11:56,500 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:56,500 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] [2019-11-16 00:11:56,503 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1332151771, now seen corresponding path program 1 times [2019-11-16 00:11:56,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:56,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065942878] [2019-11-16 00:11:56,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:56,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:56,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:56,763 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-16 00:11:56,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065942878] [2019-11-16 00:11:56,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:56,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:56,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994075669] [2019-11-16 00:11:56,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:56,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:56,786 INFO L87 Difference]: Start difference. First operand 25978 states. Second operand 4 states. [2019-11-16 00:11:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:57,373 INFO L93 Difference]: Finished difference Result 26618 states and 102123 transitions. [2019-11-16 00:11:57,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:57,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-16 00:11:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:57,604 INFO L225 Difference]: With dead ends: 26618 [2019-11-16 00:11:57,604 INFO L226 Difference]: Without dead ends: 20362 [2019-11-16 00:11:57,606 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-16 00:11:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-11-16 00:11:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20362. [2019-11-16 00:11:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20362 states. [2019-11-16 00:11:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20362 states to 20362 states and 78427 transitions. [2019-11-16 00:11:58,851 INFO L78 Accepts]: Start accepts. Automaton has 20362 states and 78427 transitions. Word has length 41 [2019-11-16 00:11:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:58,855 INFO L462 AbstractCegarLoop]: Abstraction has 20362 states and 78427 transitions. [2019-11-16 00:11:58,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 20362 states and 78427 transitions. [2019-11-16 00:11:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:11:58,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:58,873 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-16 00:11:58,874 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:58,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2021761746, now seen corresponding path program 1 times [2019-11-16 00:11:58,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:58,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909305224] [2019-11-16 00:11:58,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:58,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:58,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:59,017 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-16 00:11:59,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909305224] [2019-11-16 00:11:59,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:59,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:11:59,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197108364] [2019-11-16 00:11:59,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:11:59,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:59,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:11:59,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:11:59,023 INFO L87 Difference]: Start difference. First operand 20362 states and 78427 transitions. Second operand 5 states. [2019-11-16 00:12:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:00,159 INFO L93 Difference]: Finished difference Result 31840 states and 116044 transitions. [2019-11-16 00:12:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:00,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-16 00:12:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:00,600 INFO L225 Difference]: With dead ends: 31840 [2019-11-16 00:12:00,600 INFO L226 Difference]: Without dead ends: 31288 [2019-11-16 00:12:00,601 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-16 00:12:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31288 states. [2019-11-16 00:12:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31288 to 29707. [2019-11-16 00:12:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29707 states. [2019-11-16 00:12:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29707 states to 29707 states and 109521 transitions. [2019-11-16 00:12:01,545 INFO L78 Accepts]: Start accepts. Automaton has 29707 states and 109521 transitions. Word has length 49 [2019-11-16 00:12:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:01,546 INFO L462 AbstractCegarLoop]: Abstraction has 29707 states and 109521 transitions. [2019-11-16 00:12:01,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 109521 transitions. [2019-11-16 00:12:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:12:01,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:01,553 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] [2019-11-16 00:12:01,553 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1272995116, now seen corresponding path program 1 times [2019-11-16 00:12:01,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:01,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347724488] [2019-11-16 00:12:01,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:01,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:01,689 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-16 00:12:01,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347724488] [2019-11-16 00:12:01,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:01,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:01,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631932314] [2019-11-16 00:12:01,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:01,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:01,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:01,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:01,694 INFO L87 Difference]: Start difference. First operand 29707 states and 109521 transitions. Second operand 5 states. [2019-11-16 00:12:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:02,595 INFO L93 Difference]: Finished difference Result 38698 states and 139693 transitions. [2019-11-16 00:12:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:02,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-16 00:12:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:02,759 INFO L225 Difference]: With dead ends: 38698 [2019-11-16 00:12:02,759 INFO L226 Difference]: Without dead ends: 38250 [2019-11-16 00:12:02,760 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-16 00:12:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38250 states. [2019-11-16 00:12:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38250 to 32953. [2019-11-16 00:12:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32953 states. [2019-11-16 00:12:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32953 states to 32953 states and 120530 transitions. [2019-11-16 00:12:04,191 INFO L78 Accepts]: Start accepts. Automaton has 32953 states and 120530 transitions. Word has length 50 [2019-11-16 00:12:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:04,192 INFO L462 AbstractCegarLoop]: Abstraction has 32953 states and 120530 transitions. [2019-11-16 00:12:04,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32953 states and 120530 transitions. [2019-11-16 00:12:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:12:04,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:04,201 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] [2019-11-16 00:12:04,201 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -321514024, now seen corresponding path program 1 times [2019-11-16 00:12:04,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:04,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297032347] [2019-11-16 00:12:04,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:04,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:04,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:04,244 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-16 00:12:04,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297032347] [2019-11-16 00:12:04,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:04,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:04,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570882247] [2019-11-16 00:12:04,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:04,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:04,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:04,246 INFO L87 Difference]: Start difference. First operand 32953 states and 120530 transitions. Second operand 3 states. [2019-11-16 00:12:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:04,463 INFO L93 Difference]: Finished difference Result 42414 states and 152021 transitions. [2019-11-16 00:12:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:04,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:12:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:04,709 INFO L225 Difference]: With dead ends: 42414 [2019-11-16 00:12:04,709 INFO L226 Difference]: Without dead ends: 42414 [2019-11-16 00:12:04,710 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-16 00:12:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42414 states. [2019-11-16 00:12:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42414 to 37667. [2019-11-16 00:12:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37667 states. [2019-11-16 00:12:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37667 states to 37667 states and 136334 transitions. [2019-11-16 00:12:06,233 INFO L78 Accepts]: Start accepts. Automaton has 37667 states and 136334 transitions. Word has length 52 [2019-11-16 00:12:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:06,234 INFO L462 AbstractCegarLoop]: Abstraction has 37667 states and 136334 transitions. [2019-11-16 00:12:06,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 37667 states and 136334 transitions. [2019-11-16 00:12:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:12:06,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:06,251 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] [2019-11-16 00:12:06,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:06,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:06,251 INFO L82 PathProgramCache]: Analyzing trace with hash 720601645, now seen corresponding path program 1 times [2019-11-16 00:12:06,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:06,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006633657] [2019-11-16 00:12:06,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:06,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:06,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:06,382 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-16 00:12:06,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006633657] [2019-11-16 00:12:06,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:06,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:06,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044537705] [2019-11-16 00:12:06,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:06,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:06,385 INFO L87 Difference]: Start difference. First operand 37667 states and 136334 transitions. Second operand 6 states. [2019-11-16 00:12:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:07,082 INFO L93 Difference]: Finished difference Result 48758 states and 172983 transitions. [2019-11-16 00:12:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:12:07,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-16 00:12:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:07,181 INFO L225 Difference]: With dead ends: 48758 [2019-11-16 00:12:07,181 INFO L226 Difference]: Without dead ends: 48238 [2019-11-16 00:12:07,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:12:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48238 states. [2019-11-16 00:12:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48238 to 38231. [2019-11-16 00:12:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38231 states. [2019-11-16 00:12:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38231 states to 38231 states and 138497 transitions. [2019-11-16 00:12:08,546 INFO L78 Accepts]: Start accepts. Automaton has 38231 states and 138497 transitions. Word has length 56 [2019-11-16 00:12:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:08,547 INFO L462 AbstractCegarLoop]: Abstraction has 38231 states and 138497 transitions. [2019-11-16 00:12:08,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 38231 states and 138497 transitions. [2019-11-16 00:12:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:12:08,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:08,562 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] [2019-11-16 00:12:08,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:08,563 INFO L82 PathProgramCache]: Analyzing trace with hash 347104516, now seen corresponding path program 1 times [2019-11-16 00:12:08,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:08,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25225061] [2019-11-16 00:12:08,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:08,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:08,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:08,678 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-16 00:12:08,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25225061] [2019-11-16 00:12:08,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:08,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:08,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22504177] [2019-11-16 00:12:08,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:08,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:08,682 INFO L87 Difference]: Start difference. First operand 38231 states and 138497 transitions. Second operand 6 states. [2019-11-16 00:12:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:09,465 INFO L93 Difference]: Finished difference Result 53007 states and 189573 transitions. [2019-11-16 00:12:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:09,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-16 00:12:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:09,577 INFO L225 Difference]: With dead ends: 53007 [2019-11-16 00:12:09,577 INFO L226 Difference]: Without dead ends: 52031 [2019-11-16 00:12:09,577 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-16 00:12:09,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52031 states. [2019-11-16 00:12:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52031 to 48784. [2019-11-16 00:12:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48784 states. [2019-11-16 00:12:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48784 states to 48784 states and 175228 transitions. [2019-11-16 00:12:10,476 INFO L78 Accepts]: Start accepts. Automaton has 48784 states and 175228 transitions. Word has length 56 [2019-11-16 00:12:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:10,476 INFO L462 AbstractCegarLoop]: Abstraction has 48784 states and 175228 transitions. [2019-11-16 00:12:10,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 48784 states and 175228 transitions. [2019-11-16 00:12:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:12:10,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:10,492 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] [2019-11-16 00:12:10,492 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1449846843, now seen corresponding path program 1 times [2019-11-16 00:12:10,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:10,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452527435] [2019-11-16 00:12:10,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:10,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:10,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:10,605 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-16 00:12:10,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452527435] [2019-11-16 00:12:10,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:10,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:10,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721381024] [2019-11-16 00:12:10,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:10,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:10,607 INFO L87 Difference]: Start difference. First operand 48784 states and 175228 transitions. Second operand 7 states. [2019-11-16 00:12:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:11,801 INFO L93 Difference]: Finished difference Result 70899 states and 244525 transitions. [2019-11-16 00:12:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:12:11,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-16 00:12:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:11,953 INFO L225 Difference]: With dead ends: 70899 [2019-11-16 00:12:11,953 INFO L226 Difference]: Without dead ends: 70899 [2019-11-16 00:12:11,953 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-16 00:12:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70899 states. [2019-11-16 00:12:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70899 to 57892. [2019-11-16 00:12:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57892 states. [2019-11-16 00:12:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57892 states to 57892 states and 203152 transitions. [2019-11-16 00:12:13,105 INFO L78 Accepts]: Start accepts. Automaton has 57892 states and 203152 transitions. Word has length 56 [2019-11-16 00:12:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:13,105 INFO L462 AbstractCegarLoop]: Abstraction has 57892 states and 203152 transitions. [2019-11-16 00:12:13,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 57892 states and 203152 transitions. [2019-11-16 00:12:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:12:13,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:13,120 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] [2019-11-16 00:12:13,120 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -562343162, now seen corresponding path program 1 times [2019-11-16 00:12:13,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:13,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622614413] [2019-11-16 00:12:13,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,195 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-16 00:12:13,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622614413] [2019-11-16 00:12:13,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:13,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:13,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069147127] [2019-11-16 00:12:13,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:13,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:13,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:13,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:13,197 INFO L87 Difference]: Start difference. First operand 57892 states and 203152 transitions. Second operand 4 states. [2019-11-16 00:12:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:13,261 INFO L93 Difference]: Finished difference Result 10862 states and 33397 transitions. [2019-11-16 00:12:13,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:12:13,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:12:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:13,279 INFO L225 Difference]: With dead ends: 10862 [2019-11-16 00:12:13,279 INFO L226 Difference]: Without dead ends: 9363 [2019-11-16 00:12:13,280 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-16 00:12:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9363 states. [2019-11-16 00:12:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9363 to 9315. [2019-11-16 00:12:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9315 states. [2019-11-16 00:12:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9315 states to 9315 states and 28347 transitions. [2019-11-16 00:12:13,742 INFO L78 Accepts]: Start accepts. Automaton has 9315 states and 28347 transitions. Word has length 56 [2019-11-16 00:12:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:13,743 INFO L462 AbstractCegarLoop]: Abstraction has 9315 states and 28347 transitions. [2019-11-16 00:12:13,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9315 states and 28347 transitions. [2019-11-16 00:12:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:12:13,749 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:13,749 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] [2019-11-16 00:12:13,750 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:13,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2060513033, now seen corresponding path program 1 times [2019-11-16 00:12:13,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:13,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808932936] [2019-11-16 00:12:13,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:13,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:13,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808932936] [2019-11-16 00:12:13,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:13,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:13,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809640487] [2019-11-16 00:12:13,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:13,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:13,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:13,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:13,858 INFO L87 Difference]: Start difference. First operand 9315 states and 28347 transitions. Second operand 6 states. [2019-11-16 00:12:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:14,386 INFO L93 Difference]: Finished difference Result 12169 states and 36413 transitions. [2019-11-16 00:12:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:12:14,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:12:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:14,401 INFO L225 Difference]: With dead ends: 12169 [2019-11-16 00:12:14,402 INFO L226 Difference]: Without dead ends: 12121 [2019-11-16 00:12:14,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:12:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-11-16 00:12:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 10054. [2019-11-16 00:12:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2019-11-16 00:12:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 30403 transitions. [2019-11-16 00:12:14,561 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 30403 transitions. Word has length 66 [2019-11-16 00:12:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:14,561 INFO L462 AbstractCegarLoop]: Abstraction has 10054 states and 30403 transitions. [2019-11-16 00:12:14,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 30403 transitions. [2019-11-16 00:12:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:12:14,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:14,568 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] [2019-11-16 00:12:14,568 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1184079748, now seen corresponding path program 1 times [2019-11-16 00:12:14,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548804345] [2019-11-16 00:12:14,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:14,623 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-16 00:12:14,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548804345] [2019-11-16 00:12:14,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:14,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:14,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477679015] [2019-11-16 00:12:14,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:14,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:14,625 INFO L87 Difference]: Start difference. First operand 10054 states and 30403 transitions. Second operand 4 states. [2019-11-16 00:12:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:14,888 INFO L93 Difference]: Finished difference Result 12503 states and 37312 transitions. [2019-11-16 00:12:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:14,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:12:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:14,912 INFO L225 Difference]: With dead ends: 12503 [2019-11-16 00:12:14,912 INFO L226 Difference]: Without dead ends: 12503 [2019-11-16 00:12:14,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2019-11-16 00:12:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11357. [2019-11-16 00:12:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11357 states. [2019-11-16 00:12:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11357 states to 11357 states and 34001 transitions. [2019-11-16 00:12:15,086 INFO L78 Accepts]: Start accepts. Automaton has 11357 states and 34001 transitions. Word has length 68 [2019-11-16 00:12:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:15,086 INFO L462 AbstractCegarLoop]: Abstraction has 11357 states and 34001 transitions. [2019-11-16 00:12:15,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 11357 states and 34001 transitions. [2019-11-16 00:12:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:12:15,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:15,094 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] [2019-11-16 00:12:15,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash -893129595, now seen corresponding path program 1 times [2019-11-16 00:12:15,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205281059] [2019-11-16 00:12:15,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,139 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-16 00:12:15,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205281059] [2019-11-16 00:12:15,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:15,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:15,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326324299] [2019-11-16 00:12:15,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:15,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:15,141 INFO L87 Difference]: Start difference. First operand 11357 states and 34001 transitions. Second operand 3 states. [2019-11-16 00:12:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:15,343 INFO L93 Difference]: Finished difference Result 11826 states and 35256 transitions. [2019-11-16 00:12:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:15,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-16 00:12:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:15,364 INFO L225 Difference]: With dead ends: 11826 [2019-11-16 00:12:15,364 INFO L226 Difference]: Without dead ends: 11826 [2019-11-16 00:12:15,365 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-16 00:12:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2019-11-16 00:12:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 11607. [2019-11-16 00:12:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-11-16 00:12:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 34665 transitions. [2019-11-16 00:12:15,523 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 34665 transitions. Word has length 68 [2019-11-16 00:12:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:15,523 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 34665 transitions. [2019-11-16 00:12:15,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 34665 transitions. [2019-11-16 00:12:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:15,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:15,534 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] [2019-11-16 00:12:15,534 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash -786414864, now seen corresponding path program 1 times [2019-11-16 00:12:15,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843614802] [2019-11-16 00:12:15,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,640 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-16 00:12:15,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843614802] [2019-11-16 00:12:15,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:15,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:15,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768222188] [2019-11-16 00:12:15,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:15,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:15,642 INFO L87 Difference]: Start difference. First operand 11607 states and 34665 transitions. Second operand 6 states. [2019-11-16 00:12:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:16,199 INFO L93 Difference]: Finished difference Result 12859 states and 37854 transitions. [2019-11-16 00:12:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:16,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:12:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:16,218 INFO L225 Difference]: With dead ends: 12859 [2019-11-16 00:12:16,218 INFO L226 Difference]: Without dead ends: 12859 [2019-11-16 00:12:16,218 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-16 00:12:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-11-16 00:12:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12392. [2019-11-16 00:12:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12392 states. [2019-11-16 00:12:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12392 states to 12392 states and 36620 transitions. [2019-11-16 00:12:16,431 INFO L78 Accepts]: Start accepts. Automaton has 12392 states and 36620 transitions. Word has length 70 [2019-11-16 00:12:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:16,431 INFO L462 AbstractCegarLoop]: Abstraction has 12392 states and 36620 transitions. [2019-11-16 00:12:16,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 12392 states and 36620 transitions. [2019-11-16 00:12:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:16,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:16,447 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] [2019-11-16 00:12:16,447 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1431343089, now seen corresponding path program 1 times [2019-11-16 00:12:16,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:16,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524610629] [2019-11-16 00:12:16,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:16,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:16,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:16,557 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-16 00:12:16,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524610629] [2019-11-16 00:12:16,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:16,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:16,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058838247] [2019-11-16 00:12:16,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:16,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:16,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:16,559 INFO L87 Difference]: Start difference. First operand 12392 states and 36620 transitions. Second operand 6 states. [2019-11-16 00:12:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:16,910 INFO L93 Difference]: Finished difference Result 14551 states and 41773 transitions. [2019-11-16 00:12:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:12:16,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:12:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:16,929 INFO L225 Difference]: With dead ends: 14551 [2019-11-16 00:12:16,929 INFO L226 Difference]: Without dead ends: 14551 [2019-11-16 00:12:16,930 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-16 00:12:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14551 states. [2019-11-16 00:12:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14551 to 13003. [2019-11-16 00:12:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13003 states. [2019-11-16 00:12:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13003 states to 13003 states and 37704 transitions. [2019-11-16 00:12:17,103 INFO L78 Accepts]: Start accepts. Automaton has 13003 states and 37704 transitions. Word has length 70 [2019-11-16 00:12:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:17,103 INFO L462 AbstractCegarLoop]: Abstraction has 13003 states and 37704 transitions. [2019-11-16 00:12:17,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 13003 states and 37704 transitions. [2019-11-16 00:12:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:17,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:17,115 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] [2019-11-16 00:12:17,115 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1642694002, now seen corresponding path program 1 times [2019-11-16 00:12:17,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328379059] [2019-11-16 00:12:17,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:17,179 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-16 00:12:17,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328379059] [2019-11-16 00:12:17,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:17,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:17,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228163845] [2019-11-16 00:12:17,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:17,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:17,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:17,180 INFO L87 Difference]: Start difference. First operand 13003 states and 37704 transitions. Second operand 5 states. [2019-11-16 00:12:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:17,618 INFO L93 Difference]: Finished difference Result 17566 states and 50786 transitions. [2019-11-16 00:12:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:17,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:12:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:17,661 INFO L225 Difference]: With dead ends: 17566 [2019-11-16 00:12:17,662 INFO L226 Difference]: Without dead ends: 17566 [2019-11-16 00:12:17,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2019-11-16 00:12:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 13782. [2019-11-16 00:12:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13782 states. [2019-11-16 00:12:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13782 states to 13782 states and 39962 transitions. [2019-11-16 00:12:17,955 INFO L78 Accepts]: Start accepts. Automaton has 13782 states and 39962 transitions. Word has length 70 [2019-11-16 00:12:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:17,956 INFO L462 AbstractCegarLoop]: Abstraction has 13782 states and 39962 transitions. [2019-11-16 00:12:17,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 13782 states and 39962 transitions. [2019-11-16 00:12:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:17,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:17,969 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] [2019-11-16 00:12:17,969 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -164760461, now seen corresponding path program 1 times [2019-11-16 00:12:17,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65944866] [2019-11-16 00:12:17,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,074 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-16 00:12:18,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65944866] [2019-11-16 00:12:18,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:18,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:18,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413486360] [2019-11-16 00:12:18,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:18,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:18,076 INFO L87 Difference]: Start difference. First operand 13782 states and 39962 transitions. Second operand 6 states. [2019-11-16 00:12:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:18,714 INFO L93 Difference]: Finished difference Result 24003 states and 69660 transitions. [2019-11-16 00:12:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:18,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:12:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:18,740 INFO L225 Difference]: With dead ends: 24003 [2019-11-16 00:12:18,740 INFO L226 Difference]: Without dead ends: 24003 [2019-11-16 00:12:18,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24003 states. [2019-11-16 00:12:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24003 to 18804. [2019-11-16 00:12:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18804 states. [2019-11-16 00:12:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18804 states to 18804 states and 55265 transitions. [2019-11-16 00:12:19,006 INFO L78 Accepts]: Start accepts. Automaton has 18804 states and 55265 transitions. Word has length 70 [2019-11-16 00:12:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:19,007 INFO L462 AbstractCegarLoop]: Abstraction has 18804 states and 55265 transitions. [2019-11-16 00:12:19,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18804 states and 55265 transitions. [2019-11-16 00:12:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:19,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:19,018 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] [2019-11-16 00:12:19,018 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 722743220, now seen corresponding path program 1 times [2019-11-16 00:12:19,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:19,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65969067] [2019-11-16 00:12:19,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:19,080 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-16 00:12:19,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65969067] [2019-11-16 00:12:19,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:19,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:19,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046546159] [2019-11-16 00:12:19,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:19,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:19,083 INFO L87 Difference]: Start difference. First operand 18804 states and 55265 transitions. Second operand 4 states. [2019-11-16 00:12:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:19,595 INFO L93 Difference]: Finished difference Result 20694 states and 60239 transitions. [2019-11-16 00:12:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:12:19,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-16 00:12:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:19,626 INFO L225 Difference]: With dead ends: 20694 [2019-11-16 00:12:19,627 INFO L226 Difference]: Without dead ends: 20358 [2019-11-16 00:12:19,627 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-16 00:12:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-11-16 00:12:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 18633. [2019-11-16 00:12:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18633 states. [2019-11-16 00:12:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 54389 transitions. [2019-11-16 00:12:19,875 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 54389 transitions. Word has length 70 [2019-11-16 00:12:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:19,875 INFO L462 AbstractCegarLoop]: Abstraction has 18633 states and 54389 transitions. [2019-11-16 00:12:19,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 54389 transitions. [2019-11-16 00:12:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:19,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:19,885 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] [2019-11-16 00:12:19,886 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1961711820, now seen corresponding path program 1 times [2019-11-16 00:12:19,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:19,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325654633] [2019-11-16 00:12:19,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:19,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,044 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-16 00:12:20,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325654633] [2019-11-16 00:12:20,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:20,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:12:20,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95476665] [2019-11-16 00:12:20,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:12:20,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:20,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:12:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:20,046 INFO L87 Difference]: Start difference. First operand 18633 states and 54389 transitions. Second operand 9 states. [2019-11-16 00:12:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:20,742 INFO L93 Difference]: Finished difference Result 23558 states and 68032 transitions. [2019-11-16 00:12:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:12:20,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-11-16 00:12:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:20,784 INFO L225 Difference]: With dead ends: 23558 [2019-11-16 00:12:20,785 INFO L226 Difference]: Without dead ends: 23558 [2019-11-16 00:12:20,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:12:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2019-11-16 00:12:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 19702. [2019-11-16 00:12:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19702 states. [2019-11-16 00:12:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19702 states to 19702 states and 57345 transitions. [2019-11-16 00:12:21,076 INFO L78 Accepts]: Start accepts. Automaton has 19702 states and 57345 transitions. Word has length 70 [2019-11-16 00:12:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:21,076 INFO L462 AbstractCegarLoop]: Abstraction has 19702 states and 57345 transitions. [2019-11-16 00:12:21,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:12:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19702 states and 57345 transitions. [2019-11-16 00:12:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:21,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:21,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:21,086 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1074208139, now seen corresponding path program 1 times [2019-11-16 00:12:21,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:21,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973899604] [2019-11-16 00:12:21,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,158 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-16 00:12:21,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973899604] [2019-11-16 00:12:21,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:21,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:21,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022139209] [2019-11-16 00:12:21,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:21,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:21,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:21,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:21,160 INFO L87 Difference]: Start difference. First operand 19702 states and 57345 transitions. Second operand 5 states. [2019-11-16 00:12:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:21,216 INFO L93 Difference]: Finished difference Result 4912 states and 11557 transitions. [2019-11-16 00:12:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:21,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:12:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:21,221 INFO L225 Difference]: With dead ends: 4912 [2019-11-16 00:12:21,221 INFO L226 Difference]: Without dead ends: 4092 [2019-11-16 00:12:21,221 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-16 00:12:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-11-16 00:12:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3622. [2019-11-16 00:12:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2019-11-16 00:12:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 8367 transitions. [2019-11-16 00:12:21,271 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 8367 transitions. Word has length 70 [2019-11-16 00:12:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:21,272 INFO L462 AbstractCegarLoop]: Abstraction has 3622 states and 8367 transitions. [2019-11-16 00:12:21,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 8367 transitions. [2019-11-16 00:12:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:12:21,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:21,276 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] [2019-11-16 00:12:21,277 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash -685357840, now seen corresponding path program 1 times [2019-11-16 00:12:21,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:21,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761016500] [2019-11-16 00:12:21,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,332 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-16 00:12:21,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761016500] [2019-11-16 00:12:21,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:21,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:21,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093671961] [2019-11-16 00:12:21,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:21,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:21,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:21,334 INFO L87 Difference]: Start difference. First operand 3622 states and 8367 transitions. Second operand 5 states. [2019-11-16 00:12:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:21,555 INFO L93 Difference]: Finished difference Result 4158 states and 9484 transitions. [2019-11-16 00:12:21,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:21,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-16 00:12:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:21,559 INFO L225 Difference]: With dead ends: 4158 [2019-11-16 00:12:21,559 INFO L226 Difference]: Without dead ends: 4136 [2019-11-16 00:12:21,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-16 00:12:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2019-11-16 00:12:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3759. [2019-11-16 00:12:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3759 states. [2019-11-16 00:12:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 8636 transitions. [2019-11-16 00:12:21,597 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 8636 transitions. Word has length 85 [2019-11-16 00:12:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:21,598 INFO L462 AbstractCegarLoop]: Abstraction has 3759 states and 8636 transitions. [2019-11-16 00:12:21,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 8636 transitions. [2019-11-16 00:12:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:12:21,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:21,602 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] [2019-11-16 00:12:21,602 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:21,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2147024639, now seen corresponding path program 1 times [2019-11-16 00:12:21,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:21,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284222507] [2019-11-16 00:12:21,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,685 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-16 00:12:21,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284222507] [2019-11-16 00:12:21,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:21,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:21,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67206989] [2019-11-16 00:12:21,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:21,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:21,687 INFO L87 Difference]: Start difference. First operand 3759 states and 8636 transitions. Second operand 6 states. [2019-11-16 00:12:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:21,917 INFO L93 Difference]: Finished difference Result 5160 states and 11774 transitions. [2019-11-16 00:12:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:21,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-16 00:12:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:21,921 INFO L225 Difference]: With dead ends: 5160 [2019-11-16 00:12:21,921 INFO L226 Difference]: Without dead ends: 5142 [2019-11-16 00:12:21,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-16 00:12:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2019-11-16 00:12:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 4417. [2019-11-16 00:12:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-11-16 00:12:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 10108 transitions. [2019-11-16 00:12:21,967 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 10108 transitions. Word has length 85 [2019-11-16 00:12:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:21,967 INFO L462 AbstractCegarLoop]: Abstraction has 4417 states and 10108 transitions. [2019-11-16 00:12:21,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 10108 transitions. [2019-11-16 00:12:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:12:21,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:21,970 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] [2019-11-16 00:12:21,971 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash 350073280, now seen corresponding path program 1 times [2019-11-16 00:12:21,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:21,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26131870] [2019-11-16 00:12:21,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:22,062 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-16 00:12:22,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26131870] [2019-11-16 00:12:22,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:22,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:22,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699296049] [2019-11-16 00:12:22,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:22,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:22,064 INFO L87 Difference]: Start difference. First operand 4417 states and 10108 transitions. Second operand 7 states. [2019-11-16 00:12:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:22,438 INFO L93 Difference]: Finished difference Result 6413 states and 14786 transitions. [2019-11-16 00:12:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:12:22,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-11-16 00:12:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:22,447 INFO L225 Difference]: With dead ends: 6413 [2019-11-16 00:12:22,447 INFO L226 Difference]: Without dead ends: 6413 [2019-11-16 00:12:22,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:12:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2019-11-16 00:12:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 4768. [2019-11-16 00:12:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4768 states. [2019-11-16 00:12:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 10972 transitions. [2019-11-16 00:12:22,519 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 10972 transitions. Word has length 85 [2019-11-16 00:12:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:22,520 INFO L462 AbstractCegarLoop]: Abstraction has 4768 states and 10972 transitions. [2019-11-16 00:12:22,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 10972 transitions. [2019-11-16 00:12:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:12:22,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:22,525 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] [2019-11-16 00:12:22,525 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1237576961, now seen corresponding path program 1 times [2019-11-16 00:12:22,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:22,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791591884] [2019-11-16 00:12:22,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:22,612 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-16 00:12:22,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791591884] [2019-11-16 00:12:22,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:22,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:22,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944947411] [2019-11-16 00:12:22,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:22,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:22,614 INFO L87 Difference]: Start difference. First operand 4768 states and 10972 transitions. Second operand 6 states. [2019-11-16 00:12:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:22,675 INFO L93 Difference]: Finished difference Result 5537 states and 12657 transitions. [2019-11-16 00:12:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:22,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-16 00:12:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:22,680 INFO L225 Difference]: With dead ends: 5537 [2019-11-16 00:12:22,680 INFO L226 Difference]: Without dead ends: 5537 [2019-11-16 00:12:22,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5537 states. [2019-11-16 00:12:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5537 to 4443. [2019-11-16 00:12:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4443 states. [2019-11-16 00:12:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 10142 transitions. [2019-11-16 00:12:22,724 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 10142 transitions. Word has length 85 [2019-11-16 00:12:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:22,725 INFO L462 AbstractCegarLoop]: Abstraction has 4443 states and 10142 transitions. [2019-11-16 00:12:22,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 10142 transitions. [2019-11-16 00:12:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:12:22,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:22,728 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] [2019-11-16 00:12:22,728 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1687983009, now seen corresponding path program 1 times [2019-11-16 00:12:22,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:22,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771284018] [2019-11-16 00:12:22,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:22,832 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-16 00:12:22,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771284018] [2019-11-16 00:12:22,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:22,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:22,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691678146] [2019-11-16 00:12:22,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:22,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:22,835 INFO L87 Difference]: Start difference. First operand 4443 states and 10142 transitions. Second operand 6 states. [2019-11-16 00:12:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:22,985 INFO L93 Difference]: Finished difference Result 4263 states and 9614 transitions. [2019-11-16 00:12:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:22,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-16 00:12:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:22,990 INFO L225 Difference]: With dead ends: 4263 [2019-11-16 00:12:22,990 INFO L226 Difference]: Without dead ends: 4263 [2019-11-16 00:12:22,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2019-11-16 00:12:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3098. [2019-11-16 00:12:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-11-16 00:12:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 7070 transitions. [2019-11-16 00:12:23,040 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 7070 transitions. Word has length 85 [2019-11-16 00:12:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,041 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 7070 transitions. [2019-11-16 00:12:23,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 7070 transitions. [2019-11-16 00:12:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:12:23,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,044 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] [2019-11-16 00:12:23,045 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1721157085, now seen corresponding path program 1 times [2019-11-16 00:12:23,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:23,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603806078] [2019-11-16 00:12:23,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,207 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-16 00:12:23,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603806078] [2019-11-16 00:12:23,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:23,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:23,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954906296] [2019-11-16 00:12:23,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:23,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:23,209 INFO L87 Difference]: Start difference. First operand 3098 states and 7070 transitions. Second operand 5 states. [2019-11-16 00:12:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:23,247 INFO L93 Difference]: Finished difference Result 3098 states and 7061 transitions. [2019-11-16 00:12:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:12:23,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-16 00:12:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:23,251 INFO L225 Difference]: With dead ends: 3098 [2019-11-16 00:12:23,251 INFO L226 Difference]: Without dead ends: 3098 [2019-11-16 00:12:23,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2019-11-16 00:12:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2830. [2019-11-16 00:12:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2019-11-16 00:12:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 6460 transitions. [2019-11-16 00:12:23,292 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 6460 transitions. Word has length 87 [2019-11-16 00:12:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,292 INFO L462 AbstractCegarLoop]: Abstraction has 2830 states and 6460 transitions. [2019-11-16 00:12:23,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 6460 transitions. [2019-11-16 00:12:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:12:23,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,296 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] [2019-11-16 00:12:23,296 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1686306530, now seen corresponding path program 1 times [2019-11-16 00:12:23,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:23,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025513372] [2019-11-16 00:12:23,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,432 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-16 00:12:23,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025513372] [2019-11-16 00:12:23,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:23,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:12:23,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920176805] [2019-11-16 00:12:23,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:12:23,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:12:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:23,434 INFO L87 Difference]: Start difference. First operand 2830 states and 6460 transitions. Second operand 8 states. [2019-11-16 00:12:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:23,548 INFO L93 Difference]: Finished difference Result 4809 states and 11063 transitions. [2019-11-16 00:12:23,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:23,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-11-16 00:12:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:23,551 INFO L225 Difference]: With dead ends: 4809 [2019-11-16 00:12:23,551 INFO L226 Difference]: Without dead ends: 2070 [2019-11-16 00:12:23,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:12:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2019-11-16 00:12:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2019-11-16 00:12:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-11-16 00:12:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4750 transitions. [2019-11-16 00:12:23,577 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4750 transitions. Word has length 87 [2019-11-16 00:12:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,578 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4750 transitions. [2019-11-16 00:12:23,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:12:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4750 transitions. [2019-11-16 00:12:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:12:23,580 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,580 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] [2019-11-16 00:12:23,581 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash 305221932, now seen corresponding path program 2 times [2019-11-16 00:12:23,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:23,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29219012] [2019-11-16 00:12:23,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,737 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-16 00:12:23,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29219012] [2019-11-16 00:12:23,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:23,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:12:23,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635261532] [2019-11-16 00:12:23,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:23,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:23,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:23,739 INFO L87 Difference]: Start difference. First operand 2070 states and 4750 transitions. Second operand 10 states. [2019-11-16 00:12:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:24,142 INFO L93 Difference]: Finished difference Result 3411 states and 7840 transitions. [2019-11-16 00:12:24,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:12:24,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-11-16 00:12:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:24,145 INFO L225 Difference]: With dead ends: 3411 [2019-11-16 00:12:24,145 INFO L226 Difference]: Without dead ends: 2242 [2019-11-16 00:12:24,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:12:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-11-16 00:12:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2107. [2019-11-16 00:12:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-11-16 00:12:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 4781 transitions. [2019-11-16 00:12:24,174 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 4781 transitions. Word has length 87 [2019-11-16 00:12:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:24,175 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 4781 transitions. [2019-11-16 00:12:24,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 4781 transitions. [2019-11-16 00:12:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:12:24,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:24,178 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] [2019-11-16 00:12:24,178 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash 363952490, now seen corresponding path program 3 times [2019-11-16 00:12:24,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:24,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94779858] [2019-11-16 00:12:24,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:24,270 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:24,270 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:12:24,437 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:12:24,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:12:24 BasicIcfg [2019-11-16 00:12:24,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:12:24,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:24,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:24,450 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:24,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:54" (3/4) ... [2019-11-16 00:12:24,452 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:12:24,584 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ed1ef8a-dd6a-4c4d-a111-c980af091218/bin/uautomizer/witness.graphml [2019-11-16 00:12:24,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:24,586 INFO L168 Benchmark]: Toolchain (without parser) took 31554.94 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 939.4 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 581.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,587 INFO L168 Benchmark]: CDTParser took 0.26 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-16 00:12:24,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,587 INFO L168 Benchmark]: Boogie Preprocessor took 55.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:24,588 INFO L168 Benchmark]: RCFGBuilder took 701.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,588 INFO L168 Benchmark]: TraceAbstraction took 29949.98 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 537.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,588 INFO L168 Benchmark]: Witness Printer took 135.06 ms. Allocated memory is still 3.5 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,590 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.26 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 650.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 701.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29949.98 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 537.2 MB. Max. memory is 11.5 GB. * Witness Printer took 135.06 ms. Allocated memory is still 3.5 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 198 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7108 SDtfs, 8032 SDslu, 16444 SDs, 0 SdLazy, 6122 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57892occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 63824 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1881 NumberOfCodeBlocks, 1881 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 348001 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...