./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/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 e4a72557a25d3ff27b5a7864de9df538301d131d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:09:15,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:09:15,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:09:15,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:09:15,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:09:15,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:09:15,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:09:15,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:09:15,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:09:15,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:09:15,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:09:15,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:09:15,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:09:15,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:09:15,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:09:15,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:09:15,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:09:15,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:09:15,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:09:15,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:09:15,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:09:15,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:09:15,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:09:15,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:09:15,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:09:15,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:09:15,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:09:15,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:09:15,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:09:15,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:09:15,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:09:15,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:09:15,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:09:15,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:09:15,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:09:15,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:09:15,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:09:15,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:09:15,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:09:15,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:09:15,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:09:15,184 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:09:15,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:09:15,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:09:15,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:09:15,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:09:15,205 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:09:15,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:09:15,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:09:15,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:09:15,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:09:15,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:09:15,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:09:15,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:09:15,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:09:15,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:09:15,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:09:15,209 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:09:15,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:09:15,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:09:15,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:09:15,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:09:15,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:09:15,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:09:15,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:09:15,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:09:15,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:09:15,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:09:15,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:09:15,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:09:15,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/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 -> e4a72557a25d3ff27b5a7864de9df538301d131d [2019-11-16 00:09:15,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:09:15,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:09:15,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:09:15,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:09:15,300 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:09:15,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-16 00:09:15,376 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/data/76152ff51/4b57c024899f47d38766e616fb1ee02b/FLAG8bb87e07d [2019-11-16 00:09:15,954 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:09:15,958 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-16 00:09:15,976 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/data/76152ff51/4b57c024899f47d38766e616fb1ee02b/FLAG8bb87e07d [2019-11-16 00:09:16,259 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/data/76152ff51/4b57c024899f47d38766e616fb1ee02b [2019-11-16 00:09:16,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:09:16,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:09:16,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:09:16,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:09:16,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:09:16,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:16" (1/1) ... [2019-11-16 00:09:16,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f289042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:16, skipping insertion in model container [2019-11-16 00:09:16,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:16" (1/1) ... [2019-11-16 00:09:16,287 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:09:16,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:09:16,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:09:16,850 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:09:16,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:09:17,060 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:09:17,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17 WrapperNode [2019-11-16 00:09:17,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:09:17,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:09:17,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:09:17,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:09:17,073 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:09:17" (1/1) ... [2019-11-16 00:09:17,101 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:09:17" (1/1) ... [2019-11-16 00:09:17,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:09:17,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:09:17,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:09:17,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:09:17,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... [2019-11-16 00:09:17,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:09:17,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:09:17,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:09:17,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:09:17,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/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:09:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:09:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:09:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:09:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:09:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:09:17,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:09:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:09:17,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:09:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:09:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:09:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:09:17,275 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:09:17,878 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:09:17,878 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:09:17,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:17 BoogieIcfgContainer [2019-11-16 00:09:17,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:09:17,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:09:17,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:09:17,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:09:17,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:09:16" (1/3) ... [2019-11-16 00:09:17,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2393154b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:09:17, skipping insertion in model container [2019-11-16 00:09:17,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:17" (2/3) ... [2019-11-16 00:09:17,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2393154b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:09:17, skipping insertion in model container [2019-11-16 00:09:17,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:17" (3/3) ... [2019-11-16 00:09:17,886 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-11-16 00:09:17,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,941 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,942 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,957 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,957 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,957 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,958 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,958 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,958 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,958 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,958 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,959 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,959 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,959 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,960 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,960 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,961 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,961 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,962 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,962 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,962 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:09:17,962 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,963 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,965 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,966 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,966 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,966 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,966 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,967 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,967 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,969 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:09:17,979 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:09:17,980 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:09:17,989 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:09:17,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:09:18,012 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:09:18,013 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:09:18,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:09:18,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:09:18,013 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:09:18,013 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:09:18,013 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:09:18,013 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:09:18,024 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 164 transitions [2019-11-16 00:09:20,129 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25978 states. [2019-11-16 00:09:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 25978 states. [2019-11-16 00:09:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:09:20,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:20,147 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:09:20,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:20,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1332151771, now seen corresponding path program 1 times [2019-11-16 00:09:20,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:20,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774791339] [2019-11-16 00:09:20,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,464 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:09:20,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774791339] [2019-11-16 00:09:20,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:20,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:20,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053866839] [2019-11-16 00:09:20,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:20,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:20,485 INFO L87 Difference]: Start difference. First operand 25978 states. Second operand 4 states. [2019-11-16 00:09:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:21,129 INFO L93 Difference]: Finished difference Result 26618 states and 102123 transitions. [2019-11-16 00:09:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:09:21,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-16 00:09:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:21,395 INFO L225 Difference]: With dead ends: 26618 [2019-11-16 00:09:21,395 INFO L226 Difference]: Without dead ends: 20362 [2019-11-16 00:09:21,398 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:09:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-11-16 00:09:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20362. [2019-11-16 00:09:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20362 states. [2019-11-16 00:09:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20362 states to 20362 states and 78427 transitions. [2019-11-16 00:09:22,914 INFO L78 Accepts]: Start accepts. Automaton has 20362 states and 78427 transitions. Word has length 41 [2019-11-16 00:09:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:22,915 INFO L462 AbstractCegarLoop]: Abstraction has 20362 states and 78427 transitions. [2019-11-16 00:09:22,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 20362 states and 78427 transitions. [2019-11-16 00:09:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:09:22,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:22,930 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:09:22,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2021761746, now seen corresponding path program 1 times [2019-11-16 00:09:22,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:22,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66716490] [2019-11-16 00:09:22,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:22,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:22,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,116 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:09:23,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66716490] [2019-11-16 00:09:23,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:23,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:23,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619817828] [2019-11-16 00:09:23,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:23,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:23,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:23,120 INFO L87 Difference]: Start difference. First operand 20362 states and 78427 transitions. Second operand 5 states. [2019-11-16 00:09:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:24,486 INFO L93 Difference]: Finished difference Result 31840 states and 116044 transitions. [2019-11-16 00:09:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:24,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-16 00:09:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:24,640 INFO L225 Difference]: With dead ends: 31840 [2019-11-16 00:09:24,640 INFO L226 Difference]: Without dead ends: 31288 [2019-11-16 00:09:24,641 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:09:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31288 states. [2019-11-16 00:09:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31288 to 29707. [2019-11-16 00:09:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29707 states. [2019-11-16 00:09:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29707 states to 29707 states and 109521 transitions. [2019-11-16 00:09:26,341 INFO L78 Accepts]: Start accepts. Automaton has 29707 states and 109521 transitions. Word has length 49 [2019-11-16 00:09:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:26,342 INFO L462 AbstractCegarLoop]: Abstraction has 29707 states and 109521 transitions. [2019-11-16 00:09:26,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 109521 transitions. [2019-11-16 00:09:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:09:26,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:26,350 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:09:26,351 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1608863874, now seen corresponding path program 1 times [2019-11-16 00:09:26,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:26,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351210493] [2019-11-16 00:09:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:26,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:26,503 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:09:26,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351210493] [2019-11-16 00:09:26,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:26,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:26,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871602558] [2019-11-16 00:09:26,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:26,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:26,512 INFO L87 Difference]: Start difference. First operand 29707 states and 109521 transitions. Second operand 5 states. [2019-11-16 00:09:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:27,753 INFO L93 Difference]: Finished difference Result 38698 states and 139693 transitions. [2019-11-16 00:09:27,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:27,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-16 00:09:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:27,925 INFO L225 Difference]: With dead ends: 38698 [2019-11-16 00:09:27,925 INFO L226 Difference]: Without dead ends: 38250 [2019-11-16 00:09:27,926 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:09:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38250 states. [2019-11-16 00:09:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38250 to 32953. [2019-11-16 00:09:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32953 states. [2019-11-16 00:09:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32953 states to 32953 states and 120530 transitions. [2019-11-16 00:09:29,027 INFO L78 Accepts]: Start accepts. Automaton has 32953 states and 120530 transitions. Word has length 50 [2019-11-16 00:09:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:29,028 INFO L462 AbstractCegarLoop]: Abstraction has 32953 states and 120530 transitions. [2019-11-16 00:09:29,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32953 states and 120530 transitions. [2019-11-16 00:09:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:09:29,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:29,038 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:09:29,039 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash -321514024, now seen corresponding path program 1 times [2019-11-16 00:09:29,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:29,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321804719] [2019-11-16 00:09:29,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,083 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:09:29,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321804719] [2019-11-16 00:09:29,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:29,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:09:29,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894546701] [2019-11-16 00:09:29,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:09:29,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:09:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:29,086 INFO L87 Difference]: Start difference. First operand 32953 states and 120530 transitions. Second operand 3 states. [2019-11-16 00:09:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:29,881 INFO L93 Difference]: Finished difference Result 42414 states and 152021 transitions. [2019-11-16 00:09:29,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:09:29,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:09:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:30,166 INFO L225 Difference]: With dead ends: 42414 [2019-11-16 00:09:30,166 INFO L226 Difference]: Without dead ends: 42414 [2019-11-16 00:09:30,167 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:09:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42414 states. [2019-11-16 00:09:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42414 to 37667. [2019-11-16 00:09:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37667 states. [2019-11-16 00:09:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37667 states to 37667 states and 136334 transitions. [2019-11-16 00:09:31,254 INFO L78 Accepts]: Start accepts. Automaton has 37667 states and 136334 transitions. Word has length 52 [2019-11-16 00:09:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:31,255 INFO L462 AbstractCegarLoop]: Abstraction has 37667 states and 136334 transitions. [2019-11-16 00:09:31,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:09:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 37667 states and 136334 transitions. [2019-11-16 00:09:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:09:31,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:31,270 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:09:31,271 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 720601645, now seen corresponding path program 1 times [2019-11-16 00:09:31,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:31,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731528223] [2019-11-16 00:09:31,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:31,353 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:09:31,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731528223] [2019-11-16 00:09:31,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:31,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:31,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873000846] [2019-11-16 00:09:31,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:31,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:31,357 INFO L87 Difference]: Start difference. First operand 37667 states and 136334 transitions. Second operand 6 states. [2019-11-16 00:09:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:32,181 INFO L93 Difference]: Finished difference Result 48758 states and 172983 transitions. [2019-11-16 00:09:32,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:09:32,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-16 00:09:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:32,330 INFO L225 Difference]: With dead ends: 48758 [2019-11-16 00:09:32,331 INFO L226 Difference]: Without dead ends: 48238 [2019-11-16 00:09:32,332 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:09:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48238 states. [2019-11-16 00:09:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48238 to 38231. [2019-11-16 00:09:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38231 states. [2019-11-16 00:09:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38231 states to 38231 states and 138497 transitions. [2019-11-16 00:09:33,842 INFO L78 Accepts]: Start accepts. Automaton has 38231 states and 138497 transitions. Word has length 56 [2019-11-16 00:09:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:33,843 INFO L462 AbstractCegarLoop]: Abstraction has 38231 states and 138497 transitions. [2019-11-16 00:09:33,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 38231 states and 138497 transitions. [2019-11-16 00:09:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:09:33,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:33,859 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:09:33,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 347104516, now seen corresponding path program 1 times [2019-11-16 00:09:33,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:33,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244608923] [2019-11-16 00:09:33,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:33,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:33,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:33,997 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:09:33,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244608923] [2019-11-16 00:09:33,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:33,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:33,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500648132] [2019-11-16 00:09:33,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:33,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:33,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:33,999 INFO L87 Difference]: Start difference. First operand 38231 states and 138497 transitions. Second operand 6 states. [2019-11-16 00:09:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:34,902 INFO L93 Difference]: Finished difference Result 53007 states and 189573 transitions. [2019-11-16 00:09:34,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:34,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-16 00:09:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:35,018 INFO L225 Difference]: With dead ends: 53007 [2019-11-16 00:09:35,018 INFO L226 Difference]: Without dead ends: 52031 [2019-11-16 00:09:35,018 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:09:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52031 states. [2019-11-16 00:09:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52031 to 48784. [2019-11-16 00:09:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48784 states. [2019-11-16 00:09:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48784 states to 48784 states and 175228 transitions. [2019-11-16 00:09:36,488 INFO L78 Accepts]: Start accepts. Automaton has 48784 states and 175228 transitions. Word has length 56 [2019-11-16 00:09:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:36,488 INFO L462 AbstractCegarLoop]: Abstraction has 48784 states and 175228 transitions. [2019-11-16 00:09:36,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 48784 states and 175228 transitions. [2019-11-16 00:09:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:09:36,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:36,502 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:09:36,503 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1449846843, now seen corresponding path program 1 times [2019-11-16 00:09:36,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335823615] [2019-11-16 00:09:36,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,636 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:09:36,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335823615] [2019-11-16 00:09:36,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:36,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:36,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682657849] [2019-11-16 00:09:36,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:36,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:36,640 INFO L87 Difference]: Start difference. First operand 48784 states and 175228 transitions. Second operand 7 states. [2019-11-16 00:09:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:37,850 INFO L93 Difference]: Finished difference Result 70899 states and 244525 transitions. [2019-11-16 00:09:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:09:37,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-16 00:09:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:37,996 INFO L225 Difference]: With dead ends: 70899 [2019-11-16 00:09:37,996 INFO L226 Difference]: Without dead ends: 70899 [2019-11-16 00:09:37,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:09:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70899 states. [2019-11-16 00:09:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70899 to 57892. [2019-11-16 00:09:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57892 states. [2019-11-16 00:09:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57892 states to 57892 states and 203152 transitions. [2019-11-16 00:09:40,001 INFO L78 Accepts]: Start accepts. Automaton has 57892 states and 203152 transitions. Word has length 56 [2019-11-16 00:09:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:40,002 INFO L462 AbstractCegarLoop]: Abstraction has 57892 states and 203152 transitions. [2019-11-16 00:09:40,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 57892 states and 203152 transitions. [2019-11-16 00:09:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:09:40,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:40,016 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:09:40,016 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash -562343162, now seen corresponding path program 1 times [2019-11-16 00:09:40,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:40,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369195986] [2019-11-16 00:09:40,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:40,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:40,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:40,131 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:09:40,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369195986] [2019-11-16 00:09:40,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:40,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:40,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538887384] [2019-11-16 00:09:40,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:40,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:40,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:40,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:40,133 INFO L87 Difference]: Start difference. First operand 57892 states and 203152 transitions. Second operand 4 states. [2019-11-16 00:09:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:40,215 INFO L93 Difference]: Finished difference Result 10862 states and 33397 transitions. [2019-11-16 00:09:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:40,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:09:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:40,233 INFO L225 Difference]: With dead ends: 10862 [2019-11-16 00:09:40,233 INFO L226 Difference]: Without dead ends: 9363 [2019-11-16 00:09:40,234 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:09:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9363 states. [2019-11-16 00:09:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9363 to 9315. [2019-11-16 00:09:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9315 states. [2019-11-16 00:09:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9315 states to 9315 states and 28347 transitions. [2019-11-16 00:09:40,419 INFO L78 Accepts]: Start accepts. Automaton has 9315 states and 28347 transitions. Word has length 56 [2019-11-16 00:09:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:40,419 INFO L462 AbstractCegarLoop]: Abstraction has 9315 states and 28347 transitions. [2019-11-16 00:09:40,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 9315 states and 28347 transitions. [2019-11-16 00:09:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:09:40,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:40,427 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:09:40,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 545936329, now seen corresponding path program 1 times [2019-11-16 00:09:40,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:40,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262838918] [2019-11-16 00:09:40,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:40,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:40,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:40,550 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:09:40,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262838918] [2019-11-16 00:09:40,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:40,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:40,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229956934] [2019-11-16 00:09:40,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:40,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:40,555 INFO L87 Difference]: Start difference. First operand 9315 states and 28347 transitions. Second operand 6 states. [2019-11-16 00:09:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:41,165 INFO L93 Difference]: Finished difference Result 12169 states and 36413 transitions. [2019-11-16 00:09:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:09:41,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:09:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:41,188 INFO L225 Difference]: With dead ends: 12169 [2019-11-16 00:09:41,188 INFO L226 Difference]: Without dead ends: 12121 [2019-11-16 00:09:41,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:09:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-11-16 00:09:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 10054. [2019-11-16 00:09:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2019-11-16 00:09:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 30403 transitions. [2019-11-16 00:09:41,356 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 30403 transitions. Word has length 66 [2019-11-16 00:09:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:41,356 INFO L462 AbstractCegarLoop]: Abstraction has 10054 states and 30403 transitions. [2019-11-16 00:09:41,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 30403 transitions. [2019-11-16 00:09:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:09:41,363 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:41,363 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:09:41,364 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:41,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1184079748, now seen corresponding path program 1 times [2019-11-16 00:09:41,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:41,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065202659] [2019-11-16 00:09:41,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:41,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:41,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:41,425 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:09:41,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065202659] [2019-11-16 00:09:41,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:41,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:41,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092374904] [2019-11-16 00:09:41,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:41,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:41,427 INFO L87 Difference]: Start difference. First operand 10054 states and 30403 transitions. Second operand 4 states. [2019-11-16 00:09:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:41,719 INFO L93 Difference]: Finished difference Result 12503 states and 37312 transitions. [2019-11-16 00:09:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:09:41,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:09:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:41,737 INFO L225 Difference]: With dead ends: 12503 [2019-11-16 00:09:41,737 INFO L226 Difference]: Without dead ends: 12503 [2019-11-16 00:09:41,737 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:09:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2019-11-16 00:09:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11357. [2019-11-16 00:09:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11357 states. [2019-11-16 00:09:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11357 states to 11357 states and 34001 transitions. [2019-11-16 00:09:41,901 INFO L78 Accepts]: Start accepts. Automaton has 11357 states and 34001 transitions. Word has length 68 [2019-11-16 00:09:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:41,902 INFO L462 AbstractCegarLoop]: Abstraction has 11357 states and 34001 transitions. [2019-11-16 00:09:41,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 11357 states and 34001 transitions. [2019-11-16 00:09:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:09:41,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:41,910 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:09:41,911 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash -893129595, now seen corresponding path program 1 times [2019-11-16 00:09:41,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:41,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33695859] [2019-11-16 00:09:41,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:41,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:41,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:41,958 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:09:41,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33695859] [2019-11-16 00:09:41,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:41,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:09:41,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727103818] [2019-11-16 00:09:41,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:09:41,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:41,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:09:41,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:41,961 INFO L87 Difference]: Start difference. First operand 11357 states and 34001 transitions. Second operand 3 states. [2019-11-16 00:09:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:42,214 INFO L93 Difference]: Finished difference Result 11826 states and 35256 transitions. [2019-11-16 00:09:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:09:42,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-16 00:09:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:42,236 INFO L225 Difference]: With dead ends: 11826 [2019-11-16 00:09:42,236 INFO L226 Difference]: Without dead ends: 11826 [2019-11-16 00:09:42,236 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:09:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2019-11-16 00:09:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 11607. [2019-11-16 00:09:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-11-16 00:09:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 34665 transitions. [2019-11-16 00:09:42,417 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 34665 transitions. Word has length 68 [2019-11-16 00:09:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:42,417 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 34665 transitions. [2019-11-16 00:09:42,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:09:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 34665 transitions. [2019-11-16 00:09:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:42,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:42,428 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:09:42,429 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -786414864, now seen corresponding path program 1 times [2019-11-16 00:09:42,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505486782] [2019-11-16 00:09:42,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:42,604 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:09:42,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505486782] [2019-11-16 00:09:42,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:42,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:42,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171186092] [2019-11-16 00:09:42,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:42,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:42,607 INFO L87 Difference]: Start difference. First operand 11607 states and 34665 transitions. Second operand 6 states. [2019-11-16 00:09:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:43,308 INFO L93 Difference]: Finished difference Result 12859 states and 37854 transitions. [2019-11-16 00:09:43,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:43,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:09:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:43,333 INFO L225 Difference]: With dead ends: 12859 [2019-11-16 00:09:43,333 INFO L226 Difference]: Without dead ends: 12859 [2019-11-16 00:09:43,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:09:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-11-16 00:09:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12392. [2019-11-16 00:09:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12392 states. [2019-11-16 00:09:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12392 states to 12392 states and 36620 transitions. [2019-11-16 00:09:43,573 INFO L78 Accepts]: Start accepts. Automaton has 12392 states and 36620 transitions. Word has length 70 [2019-11-16 00:09:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:43,574 INFO L462 AbstractCegarLoop]: Abstraction has 12392 states and 36620 transitions. [2019-11-16 00:09:43,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12392 states and 36620 transitions. [2019-11-16 00:09:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:43,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:43,590 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:09:43,590 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1431343089, now seen corresponding path program 1 times [2019-11-16 00:09:43,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:43,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959168335] [2019-11-16 00:09:43,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:43,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:43,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:43,696 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:09:43,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959168335] [2019-11-16 00:09:43,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:43,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:43,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880841396] [2019-11-16 00:09:43,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:43,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:43,698 INFO L87 Difference]: Start difference. First operand 12392 states and 36620 transitions. Second operand 6 states. [2019-11-16 00:09:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:44,127 INFO L93 Difference]: Finished difference Result 14551 states and 41773 transitions. [2019-11-16 00:09:44,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:09:44,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:09:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:44,147 INFO L225 Difference]: With dead ends: 14551 [2019-11-16 00:09:44,147 INFO L226 Difference]: Without dead ends: 14551 [2019-11-16 00:09:44,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:09:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14551 states. [2019-11-16 00:09:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14551 to 13003. [2019-11-16 00:09:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13003 states. [2019-11-16 00:09:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13003 states to 13003 states and 37704 transitions. [2019-11-16 00:09:44,800 INFO L78 Accepts]: Start accepts. Automaton has 13003 states and 37704 transitions. Word has length 70 [2019-11-16 00:09:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:44,801 INFO L462 AbstractCegarLoop]: Abstraction has 13003 states and 37704 transitions. [2019-11-16 00:09:44,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13003 states and 37704 transitions. [2019-11-16 00:09:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:44,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:44,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:44,813 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1642694002, now seen corresponding path program 1 times [2019-11-16 00:09:44,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:44,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298622460] [2019-11-16 00:09:44,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:44,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:44,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:44,894 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:09:44,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298622460] [2019-11-16 00:09:44,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:44,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:44,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226896013] [2019-11-16 00:09:44,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:44,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:44,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:44,896 INFO L87 Difference]: Start difference. First operand 13003 states and 37704 transitions. Second operand 5 states. [2019-11-16 00:09:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:45,308 INFO L93 Difference]: Finished difference Result 17566 states and 50786 transitions. [2019-11-16 00:09:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:45,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:09:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:45,331 INFO L225 Difference]: With dead ends: 17566 [2019-11-16 00:09:45,331 INFO L226 Difference]: Without dead ends: 17566 [2019-11-16 00:09:45,332 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:09:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2019-11-16 00:09:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 13782. [2019-11-16 00:09:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13782 states. [2019-11-16 00:09:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13782 states to 13782 states and 39962 transitions. [2019-11-16 00:09:45,556 INFO L78 Accepts]: Start accepts. Automaton has 13782 states and 39962 transitions. Word has length 70 [2019-11-16 00:09:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:45,557 INFO L462 AbstractCegarLoop]: Abstraction has 13782 states and 39962 transitions. [2019-11-16 00:09:45,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 13782 states and 39962 transitions. [2019-11-16 00:09:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:45,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:45,567 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:09:45,567 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -164760461, now seen corresponding path program 1 times [2019-11-16 00:09:45,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:45,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300513911] [2019-11-16 00:09:45,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:45,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:45,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:45,632 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:09:45,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300513911] [2019-11-16 00:09:45,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:45,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:45,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568814679] [2019-11-16 00:09:45,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:09:45,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:45,634 INFO L87 Difference]: Start difference. First operand 13782 states and 39962 transitions. Second operand 4 states. [2019-11-16 00:09:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:46,180 INFO L93 Difference]: Finished difference Result 19773 states and 57600 transitions. [2019-11-16 00:09:46,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:46,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-16 00:09:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:46,207 INFO L225 Difference]: With dead ends: 19773 [2019-11-16 00:09:46,207 INFO L226 Difference]: Without dead ends: 19497 [2019-11-16 00:09:46,207 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:09:46,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2019-11-16 00:09:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 17877. [2019-11-16 00:09:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2019-11-16 00:09:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 52151 transitions. [2019-11-16 00:09:46,467 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 52151 transitions. Word has length 70 [2019-11-16 00:09:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:46,467 INFO L462 AbstractCegarLoop]: Abstraction has 17877 states and 52151 transitions. [2019-11-16 00:09:46,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:09:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 52151 transitions. [2019-11-16 00:09:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:46,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:46,478 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:09:46,479 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1961711820, now seen corresponding path program 1 times [2019-11-16 00:09:46,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:46,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725456212] [2019-11-16 00:09:46,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:46,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:46,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:46,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:09:46,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725456212] [2019-11-16 00:09:46,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:46,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:46,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563919047] [2019-11-16 00:09:46,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:46,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:46,623 INFO L87 Difference]: Start difference. First operand 17877 states and 52151 transitions. Second operand 7 states. [2019-11-16 00:09:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:47,109 INFO L93 Difference]: Finished difference Result 15643 states and 43105 transitions. [2019-11-16 00:09:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:09:47,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-16 00:09:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:47,136 INFO L225 Difference]: With dead ends: 15643 [2019-11-16 00:09:47,136 INFO L226 Difference]: Without dead ends: 15643 [2019-11-16 00:09:47,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15643 states. [2019-11-16 00:09:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15643 to 12478. [2019-11-16 00:09:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12478 states. [2019-11-16 00:09:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12478 states to 12478 states and 34355 transitions. [2019-11-16 00:09:47,334 INFO L78 Accepts]: Start accepts. Automaton has 12478 states and 34355 transitions. Word has length 70 [2019-11-16 00:09:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:47,335 INFO L462 AbstractCegarLoop]: Abstraction has 12478 states and 34355 transitions. [2019-11-16 00:09:47,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 12478 states and 34355 transitions. [2019-11-16 00:09:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:09:47,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:47,342 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:09:47,343 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1074208139, now seen corresponding path program 1 times [2019-11-16 00:09:47,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:47,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633996812] [2019-11-16 00:09:47,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:47,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:47,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:47,423 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:09:47,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633996812] [2019-11-16 00:09:47,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:47,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:47,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6694070] [2019-11-16 00:09:47,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:47,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:47,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:47,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:47,425 INFO L87 Difference]: Start difference. First operand 12478 states and 34355 transitions. Second operand 5 states. [2019-11-16 00:09:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:47,481 INFO L93 Difference]: Finished difference Result 4027 states and 9374 transitions. [2019-11-16 00:09:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:09:47,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-16 00:09:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:47,486 INFO L225 Difference]: With dead ends: 4027 [2019-11-16 00:09:47,486 INFO L226 Difference]: Without dead ends: 3354 [2019-11-16 00:09:47,487 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:09:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-11-16 00:09:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3094. [2019-11-16 00:09:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2019-11-16 00:09:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 7080 transitions. [2019-11-16 00:09:47,534 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 7080 transitions. Word has length 70 [2019-11-16 00:09:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:47,534 INFO L462 AbstractCegarLoop]: Abstraction has 3094 states and 7080 transitions. [2019-11-16 00:09:47,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 7080 transitions. [2019-11-16 00:09:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:47,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:47,539 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:09:47,539 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash 605353181, now seen corresponding path program 1 times [2019-11-16 00:09:47,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:47,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685991477] [2019-11-16 00:09:47,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:47,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:47,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:47,701 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:09:47,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685991477] [2019-11-16 00:09:47,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:47,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:47,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501984534] [2019-11-16 00:09:47,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:47,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:47,703 INFO L87 Difference]: Start difference. First operand 3094 states and 7080 transitions. Second operand 7 states. [2019-11-16 00:09:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:48,233 INFO L93 Difference]: Finished difference Result 3733 states and 8441 transitions. [2019-11-16 00:09:48,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:09:48,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-16 00:09:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:48,237 INFO L225 Difference]: With dead ends: 3733 [2019-11-16 00:09:48,238 INFO L226 Difference]: Without dead ends: 3702 [2019-11-16 00:09:48,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:09:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-11-16 00:09:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3248. [2019-11-16 00:09:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-11-16 00:09:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 7403 transitions. [2019-11-16 00:09:48,274 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 7403 transitions. Word has length 87 [2019-11-16 00:09:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 3248 states and 7403 transitions. [2019-11-16 00:09:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 7403 transitions. [2019-11-16 00:09:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:48,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:48,278 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:09:48,278 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1471856162, now seen corresponding path program 1 times [2019-11-16 00:09:48,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:48,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250512980] [2019-11-16 00:09:48,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:48,406 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:09:48,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250512980] [2019-11-16 00:09:48,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:48,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:09:48,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686711146] [2019-11-16 00:09:48,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:09:48,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:48,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:48,408 INFO L87 Difference]: Start difference. First operand 3248 states and 7403 transitions. Second operand 7 states. [2019-11-16 00:09:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:48,495 INFO L93 Difference]: Finished difference Result 5452 states and 12512 transitions. [2019-11-16 00:09:48,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:09:48,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-16 00:09:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:48,498 INFO L225 Difference]: With dead ends: 5452 [2019-11-16 00:09:48,498 INFO L226 Difference]: Without dead ends: 2297 [2019-11-16 00:09:48,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2019-11-16 00:09:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2297. [2019-11-16 00:09:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2019-11-16 00:09:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 5261 transitions. [2019-11-16 00:09:48,522 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 5261 transitions. Word has length 87 [2019-11-16 00:09:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:48,522 INFO L462 AbstractCegarLoop]: Abstraction has 2297 states and 5261 transitions. [2019-11-16 00:09:48,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:09:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 5261 transitions. [2019-11-16 00:09:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:48,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:48,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, 1, 1] [2019-11-16 00:09:48,525 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1339613390, now seen corresponding path program 1 times [2019-11-16 00:09:48,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:48,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478287481] [2019-11-16 00:09:48,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:48,591 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:09:48,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478287481] [2019-11-16 00:09:48,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:48,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:09:48,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854504675] [2019-11-16 00:09:48,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:48,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:48,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:48,594 INFO L87 Difference]: Start difference. First operand 2297 states and 5261 transitions. Second operand 5 states. [2019-11-16 00:09:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:48,823 INFO L93 Difference]: Finished difference Result 2596 states and 5880 transitions. [2019-11-16 00:09:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:48,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-16 00:09:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:48,827 INFO L225 Difference]: With dead ends: 2596 [2019-11-16 00:09:48,827 INFO L226 Difference]: Without dead ends: 2574 [2019-11-16 00:09:48,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-11-16 00:09:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2321. [2019-11-16 00:09:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-16 00:09:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 5318 transitions. [2019-11-16 00:09:48,865 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 5318 transitions. Word has length 87 [2019-11-16 00:09:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:48,866 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 5318 transitions. [2019-11-16 00:09:48,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 5318 transitions. [2019-11-16 00:09:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:48,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:48,870 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:09:48,870 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1375600336, now seen corresponding path program 1 times [2019-11-16 00:09:48,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:48,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087582864] [2019-11-16 00:09:48,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:48,987 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:09:48,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087582864] [2019-11-16 00:09:48,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:48,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:48,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025111839] [2019-11-16 00:09:48,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:09:48,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:48,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:48,989 INFO L87 Difference]: Start difference. First operand 2321 states and 5318 transitions. Second operand 6 states. [2019-11-16 00:09:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:49,200 INFO L93 Difference]: Finished difference Result 2291 states and 5232 transitions. [2019-11-16 00:09:49,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:49,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-16 00:09:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:49,203 INFO L225 Difference]: With dead ends: 2291 [2019-11-16 00:09:49,203 INFO L226 Difference]: Without dead ends: 2291 [2019-11-16 00:09:49,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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:09:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-11-16 00:09:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2263. [2019-11-16 00:09:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-11-16 00:09:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 5176 transitions. [2019-11-16 00:09:49,227 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 5176 transitions. Word has length 87 [2019-11-16 00:09:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:49,228 INFO L462 AbstractCegarLoop]: Abstraction has 2263 states and 5176 transitions. [2019-11-16 00:09:49,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:09:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 5176 transitions. [2019-11-16 00:09:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:49,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:49,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:49,231 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:49,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:49,231 INFO L82 PathProgramCache]: Analyzing trace with hash -582281749, now seen corresponding path program 1 times [2019-11-16 00:09:49,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:49,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828005604] [2019-11-16 00:09:49,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:49,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:49,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:49,443 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:09:49,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828005604] [2019-11-16 00:09:49,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:49,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:09:49,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037016381] [2019-11-16 00:09:49,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:09:49,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:09:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:49,446 INFO L87 Difference]: Start difference. First operand 2263 states and 5176 transitions. Second operand 11 states. [2019-11-16 00:09:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:50,115 INFO L93 Difference]: Finished difference Result 3150 states and 7086 transitions. [2019-11-16 00:09:50,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:09:50,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-11-16 00:09:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:50,119 INFO L225 Difference]: With dead ends: 3150 [2019-11-16 00:09:50,119 INFO L226 Difference]: Without dead ends: 3150 [2019-11-16 00:09:50,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:09:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2019-11-16 00:09:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2282. [2019-11-16 00:09:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-11-16 00:09:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 5200 transitions. [2019-11-16 00:09:50,147 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 5200 transitions. Word has length 87 [2019-11-16 00:09:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:50,148 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 5200 transitions. [2019-11-16 00:09:50,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:09:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 5200 transitions. [2019-11-16 00:09:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:50,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:50,150 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:09:50,150 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash 305221932, now seen corresponding path program 2 times [2019-11-16 00:09:50,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:50,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480813612] [2019-11-16 00:09:50,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:50,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:50,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:50,330 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:09:50,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480813612] [2019-11-16 00:09:50,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:50,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:09:50,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885230228] [2019-11-16 00:09:50,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:09:50,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:09:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:09:50,332 INFO L87 Difference]: Start difference. First operand 2282 states and 5200 transitions. Second operand 10 states. [2019-11-16 00:09:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:50,638 INFO L93 Difference]: Finished difference Result 3906 states and 8877 transitions. [2019-11-16 00:09:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:09:50,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-11-16 00:09:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:50,641 INFO L225 Difference]: With dead ends: 3906 [2019-11-16 00:09:50,641 INFO L226 Difference]: Without dead ends: 2549 [2019-11-16 00:09:50,642 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:09:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-11-16 00:09:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2319. [2019-11-16 00:09:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2019-11-16 00:09:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 5231 transitions. [2019-11-16 00:09:50,668 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 5231 transitions. Word has length 87 [2019-11-16 00:09:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:50,668 INFO L462 AbstractCegarLoop]: Abstraction has 2319 states and 5231 transitions. [2019-11-16 00:09:50,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:09:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 5231 transitions. [2019-11-16 00:09:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:09:50,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:50,671 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:09:50,671 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:50,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash 363952490, now seen corresponding path program 3 times [2019-11-16 00:09:50,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:50,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487712275] [2019-11-16 00:09:50,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:50,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:50,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:50,762 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:50,762 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:09:50,908 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:09:50,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:09:50 BasicIcfg [2019-11-16 00:09:50,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:09:50,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:09:50,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:09:50,911 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:09:50,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:17" (3/4) ... [2019-11-16 00:09:50,915 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:09:51,069 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_212f1959-a26a-4bfa-b3ae-eab05d81e075/bin/uautomizer/witness.graphml [2019-11-16 00:09:51,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:09:51,072 INFO L168 Benchmark]: Toolchain (without parser) took 34808.55 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 944.7 MB in the beginning and 979.0 MB in the end (delta: -34.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:09:51,073 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:09:51,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:51,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:51,074 INFO L168 Benchmark]: Boogie Preprocessor took 55.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:09:51,074 INFO L168 Benchmark]: RCFGBuilder took 679.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:51,075 INFO L168 Benchmark]: TraceAbstraction took 33030.69 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:09:51,075 INFO L168 Benchmark]: Witness Printer took 159.11 ms. Allocated memory is still 3.3 GB. Free memory was 1.0 GB in the beginning and 979.0 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:51,078 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 798.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 679.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33030.69 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 159.11 ms. Allocated memory is still 3.3 GB. Free memory was 1.0 GB in the beginning and 979.0 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 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 t835; 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(&t835, ((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 t836; 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(&t836, ((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: 32.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6319 SDtfs, 7410 SDslu, 14919 SDs, 0 SdLazy, 5750 SolverSat, 378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.0s 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: 12.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 54043 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1537 ConstructedInterpolants, 0 QuantifiedInterpolants, 274242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...