./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/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 73d062f571b15de43af4978f822ef6801d9be335 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:11:51,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:51,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:51,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:51,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:51,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:51,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:51,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:51,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:51,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:51,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:51,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:51,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:51,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:51,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:51,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:51,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:51,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:51,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:51,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:51,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:51,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:51,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:51,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:51,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:51,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:51,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:51,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:51,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:51,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:51,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:51,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:51,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:51,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:51,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:51,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:51,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:51,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:51,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:51,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:51,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:51,207 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:11:51,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:51,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:51,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:51,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:51,252 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:51,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:51,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:11:51,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:11:51,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:11:51,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:51,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:11:51,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:11:51,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:11:51,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:11:51,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:11:51,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:51,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:11:51,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:51,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:51,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:11:51,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:11:51,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:11:51,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:51,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:11:51,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:11:51,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:11:51,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:11:51,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:11:51,261 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_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/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 -> 73d062f571b15de43af4978f822ef6801d9be335 [2019-11-16 00:11:51,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:51,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:51,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:51,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:51,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:51,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-11-16 00:11:51,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/data/1bce62a5b/e6d0456a6f4442988404cfb1fa1f6b8c/FLAG662c3d537 [2019-11-16 00:11:52,040 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:52,044 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-11-16 00:11:52,066 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/data/1bce62a5b/e6d0456a6f4442988404cfb1fa1f6b8c/FLAG662c3d537 [2019-11-16 00:11:52,251 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/data/1bce62a5b/e6d0456a6f4442988404cfb1fa1f6b8c [2019-11-16 00:11:52,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:52,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:11:52,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:52,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:52,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:52,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:52" (1/1) ... [2019-11-16 00:11:52,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54151c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:52, skipping insertion in model container [2019-11-16 00:11:52,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:52" (1/1) ... [2019-11-16 00:11:52,277 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:52,354 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:52,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:52,982 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:53,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:53,203 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:53,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53 WrapperNode [2019-11-16 00:11:53,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:53,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:53,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:11:53,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:11:53,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:53,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:53,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:53,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:53,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... [2019-11-16 00:11:53,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:53,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:53,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:53,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:53,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:11:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:11:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:11:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:11:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:11:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:11:53,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:11:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:11:53,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:11:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:11:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:53,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:53,409 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:11:54,459 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:54,459 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:11:54,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:54 BoogieIcfgContainer [2019-11-16 00:11:54,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:54,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:11:54,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:11:54,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:11:54,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:52" (1/3) ... [2019-11-16 00:11:54,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae943d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:54, skipping insertion in model container [2019-11-16 00:11:54,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:53" (2/3) ... [2019-11-16 00:11:54,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae943d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:54, skipping insertion in model container [2019-11-16 00:11:54,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:54" (3/3) ... [2019-11-16 00:11:54,468 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-11-16 00:11:54,516 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,517 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,517 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,517 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,517 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,517 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,518 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,518 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,518 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,522 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,522 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,522 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,522 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,525 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,526 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,527 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,532 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,533 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,534 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,538 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,538 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,538 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,538 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:11:54,562 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:11:54,562 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:11:54,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:11:54,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:11:54,604 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:11:54,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:11:54,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:11:54,605 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:54,605 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:54,605 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:11:54,605 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:54,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:11:54,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-16 00:11:57,999 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32589 states. [2019-11-16 00:11:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32589 states. [2019-11-16 00:11:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:11:58,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:58,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:58,016 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash 737563216, now seen corresponding path program 1 times [2019-11-16 00:11:58,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:58,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591185840] [2019-11-16 00:11:58,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:58,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:58,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:58,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591185840] [2019-11-16 00:11:58,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:58,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:58,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316428731] [2019-11-16 00:11:58,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:58,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:58,465 INFO L87 Difference]: Start difference. First operand 32589 states. Second operand 4 states. [2019-11-16 00:11:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:59,522 INFO L93 Difference]: Finished difference Result 33589 states and 129566 transitions. [2019-11-16 00:11:59,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:59,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-16 00:11:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:59,837 INFO L225 Difference]: With dead ends: 33589 [2019-11-16 00:11:59,838 INFO L226 Difference]: Without dead ends: 25701 [2019-11-16 00:11:59,840 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:12:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25701 states. [2019-11-16 00:12:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25701 to 25701. [2019-11-16 00:12:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25701 states. [2019-11-16 00:12:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25701 states to 25701 states and 99582 transitions. [2019-11-16 00:12:01,695 INFO L78 Accepts]: Start accepts. Automaton has 25701 states and 99582 transitions. Word has length 32 [2019-11-16 00:12:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:01,696 INFO L462 AbstractCegarLoop]: Abstraction has 25701 states and 99582 transitions. [2019-11-16 00:12:01,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25701 states and 99582 transitions. [2019-11-16 00:12:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:12:01,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:01,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:01,708 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:01,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1112209964, now seen corresponding path program 1 times [2019-11-16 00:12:01,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:01,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478560947] [2019-11-16 00:12:01,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:01,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:01,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:01,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478560947] [2019-11-16 00:12:01,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:01,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:01,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245270361] [2019-11-16 00:12:01,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:01,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:01,822 INFO L87 Difference]: Start difference. First operand 25701 states and 99582 transitions. Second operand 5 states. [2019-11-16 00:12:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:02,829 INFO L93 Difference]: Finished difference Result 41079 states and 150429 transitions. [2019-11-16 00:12:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:02,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-16 00:12:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:02,997 INFO L225 Difference]: With dead ends: 41079 [2019-11-16 00:12:02,997 INFO L226 Difference]: Without dead ends: 40543 [2019-11-16 00:12:02,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40543 states. [2019-11-16 00:12:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40543 to 38923. [2019-11-16 00:12:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38923 states. [2019-11-16 00:12:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38923 states to 38923 states and 143579 transitions. [2019-11-16 00:12:04,886 INFO L78 Accepts]: Start accepts. Automaton has 38923 states and 143579 transitions. Word has length 44 [2019-11-16 00:12:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:04,898 INFO L462 AbstractCegarLoop]: Abstraction has 38923 states and 143579 transitions. [2019-11-16 00:12:04,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 38923 states and 143579 transitions. [2019-11-16 00:12:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:12:04,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:04,909 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:04,909 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash -64291244, now seen corresponding path program 1 times [2019-11-16 00:12:04,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:04,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636312407] [2019-11-16 00:12:04,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:04,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:04,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:05,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636312407] [2019-11-16 00:12:05,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:05,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:05,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48180415] [2019-11-16 00:12:05,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:05,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:05,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:05,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:05,076 INFO L87 Difference]: Start difference. First operand 38923 states and 143579 transitions. Second operand 5 states. [2019-11-16 00:12:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:05,783 INFO L93 Difference]: Finished difference Result 49776 states and 180631 transitions. [2019-11-16 00:12:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:05,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:12:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:06,721 INFO L225 Difference]: With dead ends: 49776 [2019-11-16 00:12:06,722 INFO L226 Difference]: Without dead ends: 49272 [2019-11-16 00:12:06,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49272 states. [2019-11-16 00:12:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49272 to 42675. [2019-11-16 00:12:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42675 states. [2019-11-16 00:12:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42675 states to 42675 states and 156590 transitions. [2019-11-16 00:12:07,995 INFO L78 Accepts]: Start accepts. Automaton has 42675 states and 156590 transitions. Word has length 45 [2019-11-16 00:12:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:07,996 INFO L462 AbstractCegarLoop]: Abstraction has 42675 states and 156590 transitions. [2019-11-16 00:12:07,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42675 states and 156590 transitions. [2019-11-16 00:12:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:12:08,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:08,007 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:08,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash -683113030, now seen corresponding path program 1 times [2019-11-16 00:12:08,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:08,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845013685] [2019-11-16 00:12:08,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:08,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:08,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:08,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845013685] [2019-11-16 00:12:08,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:08,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:08,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069882609] [2019-11-16 00:12:08,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:08,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:08,099 INFO L87 Difference]: Start difference. First operand 42675 states and 156590 transitions. Second operand 3 states. [2019-11-16 00:12:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:08,418 INFO L93 Difference]: Finished difference Result 61085 states and 221428 transitions. [2019-11-16 00:12:08,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:08,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-16 00:12:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:08,628 INFO L225 Difference]: With dead ends: 61085 [2019-11-16 00:12:08,628 INFO L226 Difference]: Without dead ends: 61085 [2019-11-16 00:12:08,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61085 states. [2019-11-16 00:12:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61085 to 48014. [2019-11-16 00:12:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48014 states. [2019-11-16 00:12:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48014 states to 48014 states and 174177 transitions. [2019-11-16 00:12:10,525 INFO L78 Accepts]: Start accepts. Automaton has 48014 states and 174177 transitions. Word has length 47 [2019-11-16 00:12:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:10,525 INFO L462 AbstractCegarLoop]: Abstraction has 48014 states and 174177 transitions. [2019-11-16 00:12:10,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48014 states and 174177 transitions. [2019-11-16 00:12:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:12:10,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:10,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] [2019-11-16 00:12:10,539 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831505, now seen corresponding path program 1 times [2019-11-16 00:12:10,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:10,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647398526] [2019-11-16 00:12:10,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:10,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:10,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:10,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647398526] [2019-11-16 00:12:10,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:10,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:10,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376769781] [2019-11-16 00:12:10,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:10,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:10,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:10,712 INFO L87 Difference]: Start difference. First operand 48014 states and 174177 transitions. Second operand 6 states. [2019-11-16 00:12:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:14,343 INFO L93 Difference]: Finished difference Result 63754 states and 229377 transitions. [2019-11-16 00:12:14,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:14,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:12:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:14,490 INFO L225 Difference]: With dead ends: 63754 [2019-11-16 00:12:14,490 INFO L226 Difference]: Without dead ends: 63754 [2019-11-16 00:12:14,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63754 states. [2019-11-16 00:12:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63754 to 59947. [2019-11-16 00:12:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59947 states. [2019-11-16 00:12:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59947 states to 59947 states and 215670 transitions. [2019-11-16 00:12:15,819 INFO L78 Accepts]: Start accepts. Automaton has 59947 states and 215670 transitions. Word has length 51 [2019-11-16 00:12:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:15,820 INFO L462 AbstractCegarLoop]: Abstraction has 59947 states and 215670 transitions. [2019-11-16 00:12:15,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 59947 states and 215670 transitions. [2019-11-16 00:12:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:12:15,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:15,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:15,837 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash 856184432, now seen corresponding path program 1 times [2019-11-16 00:12:15,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385176553] [2019-11-16 00:12:15,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:15,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385176553] [2019-11-16 00:12:15,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:15,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:15,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264983573] [2019-11-16 00:12:15,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:15,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:15,967 INFO L87 Difference]: Start difference. First operand 59947 states and 215670 transitions. Second operand 7 states. [2019-11-16 00:12:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:17,490 INFO L93 Difference]: Finished difference Result 83683 states and 290095 transitions. [2019-11-16 00:12:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:12:17,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-16 00:12:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:17,676 INFO L225 Difference]: With dead ends: 83683 [2019-11-16 00:12:17,676 INFO L226 Difference]: Without dead ends: 83683 [2019-11-16 00:12:17,676 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:12:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2019-11-16 00:12:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 71010. [2019-11-16 00:12:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71010 states. [2019-11-16 00:12:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71010 states to 71010 states and 249884 transitions. [2019-11-16 00:12:20,108 INFO L78 Accepts]: Start accepts. Automaton has 71010 states and 249884 transitions. Word has length 51 [2019-11-16 00:12:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:20,109 INFO L462 AbstractCegarLoop]: Abstraction has 71010 states and 249884 transitions. [2019-11-16 00:12:20,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 71010 states and 249884 transitions. [2019-11-16 00:12:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:12:20,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:20,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:20,124 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1743688113, now seen corresponding path program 1 times [2019-11-16 00:12:20,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:20,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548676414] [2019-11-16 00:12:20,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:20,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548676414] [2019-11-16 00:12:20,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:20,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:20,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844988295] [2019-11-16 00:12:20,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:20,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:20,218 INFO L87 Difference]: Start difference. First operand 71010 states and 249884 transitions. Second operand 4 states. [2019-11-16 00:12:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:20,302 INFO L93 Difference]: Finished difference Result 12157 states and 37827 transitions. [2019-11-16 00:12:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:12:20,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-16 00:12:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:20,325 INFO L225 Difference]: With dead ends: 12157 [2019-11-16 00:12:20,325 INFO L226 Difference]: Without dead ends: 10672 [2019-11-16 00:12:20,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10672 states. [2019-11-16 00:12:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10672 to 10623. [2019-11-16 00:12:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10623 states. [2019-11-16 00:12:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10623 states to 10623 states and 32589 transitions. [2019-11-16 00:12:20,489 INFO L78 Accepts]: Start accepts. Automaton has 10623 states and 32589 transitions. Word has length 51 [2019-11-16 00:12:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:20,490 INFO L462 AbstractCegarLoop]: Abstraction has 10623 states and 32589 transitions. [2019-11-16 00:12:20,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10623 states and 32589 transitions. [2019-11-16 00:12:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:12:20,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:20,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:20,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1023975291, now seen corresponding path program 1 times [2019-11-16 00:12:20,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:20,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945394685] [2019-11-16 00:12:20,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:20,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:20,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945394685] [2019-11-16 00:12:20,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:20,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:20,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104565220] [2019-11-16 00:12:20,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:20,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:20,572 INFO L87 Difference]: Start difference. First operand 10623 states and 32589 transitions. Second operand 6 states. [2019-11-16 00:12:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:21,178 INFO L93 Difference]: Finished difference Result 13180 states and 39870 transitions. [2019-11-16 00:12:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:12:21,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:12:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:21,206 INFO L225 Difference]: With dead ends: 13180 [2019-11-16 00:12:21,206 INFO L226 Difference]: Without dead ends: 13117 [2019-11-16 00:12:21,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:12:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13117 states. [2019-11-16 00:12:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 11046. [2019-11-16 00:12:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11046 states. [2019-11-16 00:12:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 33783 transitions. [2019-11-16 00:12:21,430 INFO L78 Accepts]: Start accepts. Automaton has 11046 states and 33783 transitions. Word has length 51 [2019-11-16 00:12:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:21,430 INFO L462 AbstractCegarLoop]: Abstraction has 11046 states and 33783 transitions. [2019-11-16 00:12:21,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11046 states and 33783 transitions. [2019-11-16 00:12:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:12:21,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:21,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:21,435 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash -126708958, now seen corresponding path program 1 times [2019-11-16 00:12:21,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:21,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954369260] [2019-11-16 00:12:21,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:21,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:21,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954369260] [2019-11-16 00:12:21,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:21,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:21,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701283372] [2019-11-16 00:12:21,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:21,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:21,758 INFO L87 Difference]: Start difference. First operand 11046 states and 33783 transitions. Second operand 4 states. [2019-11-16 00:12:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:21,939 INFO L93 Difference]: Finished difference Result 12860 states and 39389 transitions. [2019-11-16 00:12:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:12:21,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-16 00:12:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:21,967 INFO L225 Difference]: With dead ends: 12860 [2019-11-16 00:12:21,967 INFO L226 Difference]: Without dead ends: 12860 [2019-11-16 00:12:21,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12860 states. [2019-11-16 00:12:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12860 to 11691. [2019-11-16 00:12:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11691 states. [2019-11-16 00:12:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11691 states to 11691 states and 35760 transitions. [2019-11-16 00:12:22,164 INFO L78 Accepts]: Start accepts. Automaton has 11691 states and 35760 transitions. Word has length 59 [2019-11-16 00:12:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:22,164 INFO L462 AbstractCegarLoop]: Abstraction has 11691 states and 35760 transitions. [2019-11-16 00:12:22,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 11691 states and 35760 transitions. [2019-11-16 00:12:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:12:22,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:22,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:22,169 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1616101377, now seen corresponding path program 1 times [2019-11-16 00:12:22,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:22,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061932851] [2019-11-16 00:12:22,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:22,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:22,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061932851] [2019-11-16 00:12:22,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:22,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:22,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416590635] [2019-11-16 00:12:22,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:22,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:22,293 INFO L87 Difference]: Start difference. First operand 11691 states and 35760 transitions. Second operand 6 states. [2019-11-16 00:12:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:22,835 INFO L93 Difference]: Finished difference Result 14217 states and 42858 transitions. [2019-11-16 00:12:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:12:22,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-16 00:12:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:22,858 INFO L225 Difference]: With dead ends: 14217 [2019-11-16 00:12:22,858 INFO L226 Difference]: Without dead ends: 14156 [2019-11-16 00:12:22,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:12:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-11-16 00:12:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 13459. [2019-11-16 00:12:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-11-16 00:12:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 40777 transitions. [2019-11-16 00:12:23,069 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 40777 transitions. Word has length 59 [2019-11-16 00:12:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,069 INFO L462 AbstractCegarLoop]: Abstraction has 13459 states and 40777 transitions. [2019-11-16 00:12:23,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 40777 transitions. [2019-11-16 00:12:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:12:23,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,076 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:23,076 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1913952989, now seen corresponding path program 1 times [2019-11-16 00:12:23,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:23,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388964275] [2019-11-16 00:12:23,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:23,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388964275] [2019-11-16 00:12:23,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:23,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:23,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221344370] [2019-11-16 00:12:23,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:23,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:23,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:23,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:23,140 INFO L87 Difference]: Start difference. First operand 13459 states and 40777 transitions. Second operand 4 states. [2019-11-16 00:12:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:23,499 INFO L93 Difference]: Finished difference Result 16501 states and 49369 transitions. [2019-11-16 00:12:23,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:23,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:12:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:23,525 INFO L225 Difference]: With dead ends: 16501 [2019-11-16 00:12:23,525 INFO L226 Difference]: Without dead ends: 16501 [2019-11-16 00:12:23,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16501 states. [2019-11-16 00:12:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16501 to 14980. [2019-11-16 00:12:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14980 states. [2019-11-16 00:12:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14980 states to 14980 states and 44958 transitions. [2019-11-16 00:12:23,763 INFO L78 Accepts]: Start accepts. Automaton has 14980 states and 44958 transitions. Word has length 63 [2019-11-16 00:12:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:23,764 INFO L462 AbstractCegarLoop]: Abstraction has 14980 states and 44958 transitions. [2019-11-16 00:12:23,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14980 states and 44958 transitions. [2019-11-16 00:12:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:12:23,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:23,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:23,773 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1659216444, now seen corresponding path program 1 times [2019-11-16 00:12:23,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:23,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339576064] [2019-11-16 00:12:23,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:23,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:23,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339576064] [2019-11-16 00:12:23,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:23,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:23,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104080928] [2019-11-16 00:12:23,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:23,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:23,822 INFO L87 Difference]: Start difference. First operand 14980 states and 44958 transitions. Second operand 3 states. [2019-11-16 00:12:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:24,076 INFO L93 Difference]: Finished difference Result 15528 states and 46401 transitions. [2019-11-16 00:12:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:24,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-16 00:12:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:24,108 INFO L225 Difference]: With dead ends: 15528 [2019-11-16 00:12:24,108 INFO L226 Difference]: Without dead ends: 15528 [2019-11-16 00:12:24,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2019-11-16 00:12:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 15274. [2019-11-16 00:12:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15274 states. [2019-11-16 00:12:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15274 states to 15274 states and 45726 transitions. [2019-11-16 00:12:24,335 INFO L78 Accepts]: Start accepts. Automaton has 15274 states and 45726 transitions. Word has length 63 [2019-11-16 00:12:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 15274 states and 45726 transitions. [2019-11-16 00:12:24,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15274 states and 45726 transitions. [2019-11-16 00:12:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:24,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:24,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:24,346 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash -939220032, now seen corresponding path program 1 times [2019-11-16 00:12:24,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:24,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716251994] [2019-11-16 00:12:24,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:24,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:24,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716251994] [2019-11-16 00:12:24,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:24,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:24,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229379256] [2019-11-16 00:12:24,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:24,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:24,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:24,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:24,495 INFO L87 Difference]: Start difference. First operand 15274 states and 45726 transitions. Second operand 6 states. [2019-11-16 00:12:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:25,133 INFO L93 Difference]: Finished difference Result 16271 states and 48101 transitions. [2019-11-16 00:12:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:25,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:12:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:25,157 INFO L225 Difference]: With dead ends: 16271 [2019-11-16 00:12:25,157 INFO L226 Difference]: Without dead ends: 16271 [2019-11-16 00:12:25,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16271 states. [2019-11-16 00:12:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16271 to 15847. [2019-11-16 00:12:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15847 states. [2019-11-16 00:12:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15847 states to 15847 states and 47023 transitions. [2019-11-16 00:12:25,392 INFO L78 Accepts]: Start accepts. Automaton has 15847 states and 47023 transitions. Word has length 65 [2019-11-16 00:12:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:25,393 INFO L462 AbstractCegarLoop]: Abstraction has 15847 states and 47023 transitions. [2019-11-16 00:12:25,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15847 states and 47023 transitions. [2019-11-16 00:12:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:25,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:25,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:25,404 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1193956577, now seen corresponding path program 1 times [2019-11-16 00:12:25,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:25,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628634098] [2019-11-16 00:12:25,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:25,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:25,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:25,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628634098] [2019-11-16 00:12:25,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:25,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:25,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777445921] [2019-11-16 00:12:25,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:25,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:25,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:25,513 INFO L87 Difference]: Start difference. First operand 15847 states and 47023 transitions. Second operand 6 states. [2019-11-16 00:12:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:26,118 INFO L93 Difference]: Finished difference Result 18158 states and 52351 transitions. [2019-11-16 00:12:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:12:26,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:12:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:26,144 INFO L225 Difference]: With dead ends: 18158 [2019-11-16 00:12:26,144 INFO L226 Difference]: Without dead ends: 18158 [2019-11-16 00:12:26,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18158 states. [2019-11-16 00:12:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18158 to 16539. [2019-11-16 00:12:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16539 states. [2019-11-16 00:12:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16539 states to 16539 states and 48243 transitions. [2019-11-16 00:12:26,401 INFO L78 Accepts]: Start accepts. Automaton has 16539 states and 48243 transitions. Word has length 65 [2019-11-16 00:12:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:26,401 INFO L462 AbstractCegarLoop]: Abstraction has 16539 states and 48243 transitions. [2019-11-16 00:12:26,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16539 states and 48243 transitions. [2019-11-16 00:12:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:26,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:26,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:26,413 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1260963330, now seen corresponding path program 1 times [2019-11-16 00:12:26,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:26,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887079018] [2019-11-16 00:12:26,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:26,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:26,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:26,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887079018] [2019-11-16 00:12:26,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:26,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:26,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920953208] [2019-11-16 00:12:26,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:26,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:26,500 INFO L87 Difference]: Start difference. First operand 16539 states and 48243 transitions. Second operand 5 states. [2019-11-16 00:12:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:26,951 INFO L93 Difference]: Finished difference Result 21453 states and 62483 transitions. [2019-11-16 00:12:26,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:26,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:12:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:26,982 INFO L225 Difference]: With dead ends: 21453 [2019-11-16 00:12:26,982 INFO L226 Difference]: Without dead ends: 21453 [2019-11-16 00:12:26,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states. [2019-11-16 00:12:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 19518. [2019-11-16 00:12:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-11-16 00:12:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 56652 transitions. [2019-11-16 00:12:27,321 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 56652 transitions. Word has length 65 [2019-11-16 00:12:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:27,321 INFO L462 AbstractCegarLoop]: Abstraction has 19518 states and 56652 transitions. [2019-11-16 00:12:27,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 56652 transitions. [2019-11-16 00:12:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:27,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:27,334 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:27,334 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1771497507, now seen corresponding path program 1 times [2019-11-16 00:12:27,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:27,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762590513] [2019-11-16 00:12:27,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:27,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:27,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:27,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762590513] [2019-11-16 00:12:27,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:27,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:27,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847871518] [2019-11-16 00:12:27,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:27,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:27,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:27,411 INFO L87 Difference]: Start difference. First operand 19518 states and 56652 transitions. Second operand 5 states. [2019-11-16 00:12:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:28,175 INFO L93 Difference]: Finished difference Result 26405 states and 76310 transitions. [2019-11-16 00:12:28,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:28,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:12:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:28,217 INFO L225 Difference]: With dead ends: 26405 [2019-11-16 00:12:28,217 INFO L226 Difference]: Without dead ends: 26405 [2019-11-16 00:12:28,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:12:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26405 states. [2019-11-16 00:12:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26405 to 21406. [2019-11-16 00:12:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21406 states. [2019-11-16 00:12:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21406 states to 21406 states and 61926 transitions. [2019-11-16 00:12:28,570 INFO L78 Accepts]: Start accepts. Automaton has 21406 states and 61926 transitions. Word has length 65 [2019-11-16 00:12:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:28,570 INFO L462 AbstractCegarLoop]: Abstraction has 21406 states and 61926 transitions. [2019-11-16 00:12:28,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 21406 states and 61926 transitions. [2019-11-16 00:12:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:28,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:28,582 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:28,582 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 716015326, now seen corresponding path program 1 times [2019-11-16 00:12:28,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:28,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41330978] [2019-11-16 00:12:28,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:28,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:28,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41330978] [2019-11-16 00:12:28,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:28,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:28,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674385691] [2019-11-16 00:12:28,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:28,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:28,681 INFO L87 Difference]: Start difference. First operand 21406 states and 61926 transitions. Second operand 4 states. [2019-11-16 00:12:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:29,554 INFO L93 Difference]: Finished difference Result 27967 states and 81348 transitions. [2019-11-16 00:12:29,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:12:29,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:12:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:29,598 INFO L225 Difference]: With dead ends: 27967 [2019-11-16 00:12:29,598 INFO L226 Difference]: Without dead ends: 27832 [2019-11-16 00:12:29,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27832 states. [2019-11-16 00:12:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27832 to 25843. [2019-11-16 00:12:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25843 states. [2019-11-16 00:12:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25843 states to 25843 states and 75186 transitions. [2019-11-16 00:12:29,999 INFO L78 Accepts]: Start accepts. Automaton has 25843 states and 75186 transitions. Word has length 65 [2019-11-16 00:12:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:29,999 INFO L462 AbstractCegarLoop]: Abstraction has 25843 states and 75186 transitions. [2019-11-16 00:12:29,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 25843 states and 75186 transitions. [2019-11-16 00:12:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:30,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:30,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:30,009 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:30,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1080936033, now seen corresponding path program 1 times [2019-11-16 00:12:30,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:30,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759972867] [2019-11-16 00:12:30,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:30,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:30,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:30,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759972867] [2019-11-16 00:12:30,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:30,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:30,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332684717] [2019-11-16 00:12:30,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:30,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:30,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:30,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:30,162 INFO L87 Difference]: Start difference. First operand 25843 states and 75186 transitions. Second operand 7 states. [2019-11-16 00:12:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:30,614 INFO L93 Difference]: Finished difference Result 23111 states and 64208 transitions. [2019-11-16 00:12:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:12:30,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-16 00:12:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:30,640 INFO L225 Difference]: With dead ends: 23111 [2019-11-16 00:12:30,640 INFO L226 Difference]: Without dead ends: 23111 [2019-11-16 00:12:30,640 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:12:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23111 states. [2019-11-16 00:12:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23111 to 18807. [2019-11-16 00:12:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-11-16 00:12:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 52243 transitions. [2019-11-16 00:12:30,883 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 52243 transitions. Word has length 65 [2019-11-16 00:12:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:30,883 INFO L462 AbstractCegarLoop]: Abstraction has 18807 states and 52243 transitions. [2019-11-16 00:12:30,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 52243 transitions. [2019-11-16 00:12:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:30,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:30,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:30,891 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash -193432352, now seen corresponding path program 1 times [2019-11-16 00:12:30,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:30,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677257724] [2019-11-16 00:12:30,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:30,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:30,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:30,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677257724] [2019-11-16 00:12:30,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:30,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:30,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255491537] [2019-11-16 00:12:30,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:30,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:30,962 INFO L87 Difference]: Start difference. First operand 18807 states and 52243 transitions. Second operand 5 states. [2019-11-16 00:12:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:31,024 INFO L93 Difference]: Finished difference Result 6129 states and 14460 transitions. [2019-11-16 00:12:31,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:31,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:12:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:31,031 INFO L225 Difference]: With dead ends: 6129 [2019-11-16 00:12:31,031 INFO L226 Difference]: Without dead ends: 5259 [2019-11-16 00:12:31,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-11-16 00:12:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4724. [2019-11-16 00:12:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-11-16 00:12:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 10819 transitions. [2019-11-16 00:12:31,102 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 10819 transitions. Word has length 65 [2019-11-16 00:12:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:31,103 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 10819 transitions. [2019-11-16 00:12:31,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 10819 transitions. [2019-11-16 00:12:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:12:31,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:31,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:31,108 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2083784590, now seen corresponding path program 1 times [2019-11-16 00:12:31,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:31,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615246640] [2019-11-16 00:12:31,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:31,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:31,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:31,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615246640] [2019-11-16 00:12:31,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:31,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:31,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591823276] [2019-11-16 00:12:31,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:31,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:31,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:31,146 INFO L87 Difference]: Start difference. First operand 4724 states and 10819 transitions. Second operand 3 states. [2019-11-16 00:12:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:31,190 INFO L93 Difference]: Finished difference Result 5854 states and 13185 transitions. [2019-11-16 00:12:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:31,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-16 00:12:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:31,197 INFO L225 Difference]: With dead ends: 5854 [2019-11-16 00:12:31,197 INFO L226 Difference]: Without dead ends: 5854 [2019-11-16 00:12:31,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-11-16 00:12:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 4659. [2019-11-16 00:12:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-11-16 00:12:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 10381 transitions. [2019-11-16 00:12:31,254 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 10381 transitions. Word has length 65 [2019-11-16 00:12:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:31,254 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 10381 transitions. [2019-11-16 00:12:31,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 10381 transitions. [2019-11-16 00:12:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:12:31,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:31,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:31,258 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1306291909, now seen corresponding path program 1 times [2019-11-16 00:12:31,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:31,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686863821] [2019-11-16 00:12:31,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:31,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:31,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:31,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686863821] [2019-11-16 00:12:31,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:31,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:31,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860542959] [2019-11-16 00:12:31,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:31,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:31,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:31,321 INFO L87 Difference]: Start difference. First operand 4659 states and 10381 transitions. Second operand 5 states. [2019-11-16 00:12:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:31,491 INFO L93 Difference]: Finished difference Result 5720 states and 12810 transitions. [2019-11-16 00:12:31,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:12:31,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-16 00:12:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:31,498 INFO L225 Difference]: With dead ends: 5720 [2019-11-16 00:12:31,498 INFO L226 Difference]: Without dead ends: 5720 [2019-11-16 00:12:31,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-11-16 00:12:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5079. [2019-11-16 00:12:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2019-11-16 00:12:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11339 transitions. [2019-11-16 00:12:31,564 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11339 transitions. Word has length 71 [2019-11-16 00:12:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:31,564 INFO L462 AbstractCegarLoop]: Abstraction has 5079 states and 11339 transitions. [2019-11-16 00:12:31,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11339 transitions. [2019-11-16 00:12:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:12:31,569 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:31,569 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:31,569 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:31,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1245865052, now seen corresponding path program 1 times [2019-11-16 00:12:31,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:31,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061591509] [2019-11-16 00:12:31,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:31,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:31,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:31,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061591509] [2019-11-16 00:12:31,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:31,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:31,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403736639] [2019-11-16 00:12:31,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:12:31,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:31,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:31,645 INFO L87 Difference]: Start difference. First operand 5079 states and 11339 transitions. Second operand 7 states. [2019-11-16 00:12:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:32,015 INFO L93 Difference]: Finished difference Result 5819 states and 12862 transitions. [2019-11-16 00:12:32,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:12:32,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-16 00:12:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:32,019 INFO L225 Difference]: With dead ends: 5819 [2019-11-16 00:12:32,019 INFO L226 Difference]: Without dead ends: 5766 [2019-11-16 00:12:32,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:12:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-16 00:12:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5166. [2019-11-16 00:12:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-16 00:12:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 11428 transitions. [2019-11-16 00:12:32,076 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 11428 transitions. Word has length 71 [2019-11-16 00:12:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:32,076 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 11428 transitions. [2019-11-16 00:12:32,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:12:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 11428 transitions. [2019-11-16 00:12:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:12:32,080 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:32,081 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:32,081 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1822532973, now seen corresponding path program 1 times [2019-11-16 00:12:32,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:32,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930384169] [2019-11-16 00:12:32,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:32,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:32,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:32,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930384169] [2019-11-16 00:12:32,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:32,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:12:32,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676129284] [2019-11-16 00:12:32,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:12:32,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:12:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:32,231 INFO L87 Difference]: Start difference. First operand 5166 states and 11428 transitions. Second operand 9 states. [2019-11-16 00:12:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:33,018 INFO L93 Difference]: Finished difference Result 7248 states and 16035 transitions. [2019-11-16 00:12:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:12:33,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-11-16 00:12:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:33,024 INFO L225 Difference]: With dead ends: 7248 [2019-11-16 00:12:33,024 INFO L226 Difference]: Without dead ends: 7220 [2019-11-16 00:12:33,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:12:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-16 00:12:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6152. [2019-11-16 00:12:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-11-16 00:12:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13790 transitions. [2019-11-16 00:12:33,093 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13790 transitions. Word has length 92 [2019-11-16 00:12:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:33,093 INFO L462 AbstractCegarLoop]: Abstraction has 6152 states and 13790 transitions. [2019-11-16 00:12:33,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:12:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13790 transitions. [2019-11-16 00:12:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:12:33,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:33,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:33,101 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash -254676370, now seen corresponding path program 1 times [2019-11-16 00:12:33,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:33,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491402403] [2019-11-16 00:12:33,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:33,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491402403] [2019-11-16 00:12:33,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:33,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:33,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748052595] [2019-11-16 00:12:33,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:33,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:33,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:33,169 INFO L87 Difference]: Start difference. First operand 6152 states and 13790 transitions. Second operand 4 states. [2019-11-16 00:12:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:33,277 INFO L93 Difference]: Finished difference Result 7220 states and 16033 transitions. [2019-11-16 00:12:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:33,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:12:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:33,286 INFO L225 Difference]: With dead ends: 7220 [2019-11-16 00:12:33,286 INFO L226 Difference]: Without dead ends: 7220 [2019-11-16 00:12:33,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-16 00:12:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6335. [2019-11-16 00:12:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2019-11-16 00:12:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 14127 transitions. [2019-11-16 00:12:33,374 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 14127 transitions. Word has length 92 [2019-11-16 00:12:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:33,374 INFO L462 AbstractCegarLoop]: Abstraction has 6335 states and 14127 transitions. [2019-11-16 00:12:33,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:12:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 14127 transitions. [2019-11-16 00:12:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:33,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:33,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:33,385 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -741091311, now seen corresponding path program 1 times [2019-11-16 00:12:33,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:33,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618643037] [2019-11-16 00:12:33,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:33,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618643037] [2019-11-16 00:12:33,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:33,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:33,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382269423] [2019-11-16 00:12:33,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:33,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:33,434 INFO L87 Difference]: Start difference. First operand 6335 states and 14127 transitions. Second operand 3 states. [2019-11-16 00:12:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:33,524 INFO L93 Difference]: Finished difference Result 6878 states and 15281 transitions. [2019-11-16 00:12:33,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:33,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-16 00:12:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:33,530 INFO L225 Difference]: With dead ends: 6878 [2019-11-16 00:12:33,530 INFO L226 Difference]: Without dead ends: 6878 [2019-11-16 00:12:33,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2019-11-16 00:12:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6808. [2019-11-16 00:12:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2019-11-16 00:12:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15131 transitions. [2019-11-16 00:12:33,600 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15131 transitions. Word has length 94 [2019-11-16 00:12:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:33,600 INFO L462 AbstractCegarLoop]: Abstraction has 6808 states and 15131 transitions. [2019-11-16 00:12:33,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15131 transitions. [2019-11-16 00:12:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:33,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:33,606 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:33,606 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1557627920, now seen corresponding path program 1 times [2019-11-16 00:12:33,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:33,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838106139] [2019-11-16 00:12:33,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:33,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838106139] [2019-11-16 00:12:33,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:33,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:33,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945311265] [2019-11-16 00:12:33,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:33,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:33,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:33,719 INFO L87 Difference]: Start difference. First operand 6808 states and 15131 transitions. Second operand 5 states. [2019-11-16 00:12:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:33,857 INFO L93 Difference]: Finished difference Result 7076 states and 15692 transitions. [2019-11-16 00:12:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:33,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:12:33,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:33,865 INFO L225 Difference]: With dead ends: 7076 [2019-11-16 00:12:33,865 INFO L226 Difference]: Without dead ends: 7076 [2019-11-16 00:12:33,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2019-11-16 00:12:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5598. [2019-11-16 00:12:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-11-16 00:12:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 12422 transitions. [2019-11-16 00:12:33,955 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 12422 transitions. Word has length 94 [2019-11-16 00:12:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:33,955 INFO L462 AbstractCegarLoop]: Abstraction has 5598 states and 12422 transitions. [2019-11-16 00:12:33,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 12422 transitions. [2019-11-16 00:12:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:33,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:33,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:33,962 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash 284400688, now seen corresponding path program 1 times [2019-11-16 00:12:33,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:33,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684515213] [2019-11-16 00:12:33,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:33,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:34,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684515213] [2019-11-16 00:12:34,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:34,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:34,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610487588] [2019-11-16 00:12:34,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:34,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:34,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:34,047 INFO L87 Difference]: Start difference. First operand 5598 states and 12422 transitions. Second operand 6 states. [2019-11-16 00:12:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:34,433 INFO L93 Difference]: Finished difference Result 6709 states and 14763 transitions. [2019-11-16 00:12:34,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:12:34,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:12:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:34,441 INFO L225 Difference]: With dead ends: 6709 [2019-11-16 00:12:34,441 INFO L226 Difference]: Without dead ends: 6709 [2019-11-16 00:12:34,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:12:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-11-16 00:12:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 5275. [2019-11-16 00:12:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-11-16 00:12:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 11760 transitions. [2019-11-16 00:12:34,525 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 11760 transitions. Word has length 94 [2019-11-16 00:12:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:34,526 INFO L462 AbstractCegarLoop]: Abstraction has 5275 states and 11760 transitions. [2019-11-16 00:12:34,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 11760 transitions. [2019-11-16 00:12:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:34,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:34,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:34,533 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1740516082, now seen corresponding path program 1 times [2019-11-16 00:12:34,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:34,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301110858] [2019-11-16 00:12:34,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:34,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:34,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301110858] [2019-11-16 00:12:34,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:34,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:12:34,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384548741] [2019-11-16 00:12:34,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:34,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:34,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:34,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:34,769 INFO L87 Difference]: Start difference. First operand 5275 states and 11760 transitions. Second operand 10 states. [2019-11-16 00:12:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:36,066 INFO L93 Difference]: Finished difference Result 6303 states and 13926 transitions. [2019-11-16 00:12:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:12:36,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-16 00:12:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:36,074 INFO L225 Difference]: With dead ends: 6303 [2019-11-16 00:12:36,075 INFO L226 Difference]: Without dead ends: 6287 [2019-11-16 00:12:36,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:12:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2019-11-16 00:12:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 5580. [2019-11-16 00:12:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-11-16 00:12:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 12441 transitions. [2019-11-16 00:12:36,163 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 12441 transitions. Word has length 94 [2019-11-16 00:12:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:36,164 INFO L462 AbstractCegarLoop]: Abstraction has 5580 states and 12441 transitions. [2019-11-16 00:12:36,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 12441 transitions. [2019-11-16 00:12:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:36,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:36,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:36,171 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:36,171 INFO L82 PathProgramCache]: Analyzing trace with hash -336693261, now seen corresponding path program 1 times [2019-11-16 00:12:36,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:36,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345978044] [2019-11-16 00:12:36,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:36,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:36,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:36,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345978044] [2019-11-16 00:12:36,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:36,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:12:36,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370517247] [2019-11-16 00:12:36,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:12:36,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:12:36,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:36,260 INFO L87 Difference]: Start difference. First operand 5580 states and 12441 transitions. Second operand 6 states. [2019-11-16 00:12:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:36,418 INFO L93 Difference]: Finished difference Result 5442 states and 11943 transitions. [2019-11-16 00:12:36,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:36,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:12:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:36,422 INFO L225 Difference]: With dead ends: 5442 [2019-11-16 00:12:36,422 INFO L226 Difference]: Without dead ends: 5442 [2019-11-16 00:12:36,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:12:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2019-11-16 00:12:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 4838. [2019-11-16 00:12:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2019-11-16 00:12:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 10735 transitions. [2019-11-16 00:12:36,471 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 10735 transitions. Word has length 94 [2019-11-16 00:12:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:36,471 INFO L462 AbstractCegarLoop]: Abstraction has 4838 states and 10735 transitions. [2019-11-16 00:12:36,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:12:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 10735 transitions. [2019-11-16 00:12:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:36,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:36,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:36,475 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:36,476 INFO L82 PathProgramCache]: Analyzing trace with hash 819614451, now seen corresponding path program 1 times [2019-11-16 00:12:36,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:36,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772507889] [2019-11-16 00:12:36,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:36,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:36,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:36,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772507889] [2019-11-16 00:12:36,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:36,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:12:36,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100746811] [2019-11-16 00:12:36,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:12:36,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:12:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:36,640 INFO L87 Difference]: Start difference. First operand 4838 states and 10735 transitions. Second operand 9 states. [2019-11-16 00:12:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:37,193 INFO L93 Difference]: Finished difference Result 6317 states and 13852 transitions. [2019-11-16 00:12:37,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:12:37,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-16 00:12:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:37,199 INFO L225 Difference]: With dead ends: 6317 [2019-11-16 00:12:37,199 INFO L226 Difference]: Without dead ends: 6317 [2019-11-16 00:12:37,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:12:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2019-11-16 00:12:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5263. [2019-11-16 00:12:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5263 states. [2019-11-16 00:12:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 11595 transitions. [2019-11-16 00:12:37,255 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 11595 transitions. Word has length 94 [2019-11-16 00:12:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:37,256 INFO L462 AbstractCegarLoop]: Abstraction has 5263 states and 11595 transitions. [2019-11-16 00:12:37,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:12:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 11595 transitions. [2019-11-16 00:12:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:37,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:37,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:37,260 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:37,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1030965364, now seen corresponding path program 1 times [2019-11-16 00:12:37,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:37,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255839489] [2019-11-16 00:12:37,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:37,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255839489] [2019-11-16 00:12:37,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:37,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:12:37,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479083037] [2019-11-16 00:12:37,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:12:37,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:12:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:12:37,444 INFO L87 Difference]: Start difference. First operand 5263 states and 11595 transitions. Second operand 9 states. [2019-11-16 00:12:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:38,030 INFO L93 Difference]: Finished difference Result 6028 states and 13188 transitions. [2019-11-16 00:12:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:12:38,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-16 00:12:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:38,036 INFO L225 Difference]: With dead ends: 6028 [2019-11-16 00:12:38,036 INFO L226 Difference]: Without dead ends: 6028 [2019-11-16 00:12:38,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:12:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2019-11-16 00:12:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5575. [2019-11-16 00:12:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2019-11-16 00:12:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 12249 transitions. [2019-11-16 00:12:38,098 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 12249 transitions. Word has length 94 [2019-11-16 00:12:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:38,098 INFO L462 AbstractCegarLoop]: Abstraction has 5575 states and 12249 transitions. [2019-11-16 00:12:38,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:12:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 12249 transitions. [2019-11-16 00:12:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:38,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:38,103 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:38,103 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1918469045, now seen corresponding path program 1 times [2019-11-16 00:12:38,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:38,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736941358] [2019-11-16 00:12:38,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:38,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:38,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:38,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736941358] [2019-11-16 00:12:38,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:38,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:12:38,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030885739] [2019-11-16 00:12:38,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:38,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:38,278 INFO L87 Difference]: Start difference. First operand 5575 states and 12249 transitions. Second operand 10 states. [2019-11-16 00:12:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:38,783 INFO L93 Difference]: Finished difference Result 21556 states and 48001 transitions. [2019-11-16 00:12:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:12:38,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-16 00:12:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:38,794 INFO L225 Difference]: With dead ends: 21556 [2019-11-16 00:12:38,794 INFO L226 Difference]: Without dead ends: 12443 [2019-11-16 00:12:38,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:12:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2019-11-16 00:12:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 5226. [2019-11-16 00:12:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5226 states. [2019-11-16 00:12:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 11417 transitions. [2019-11-16 00:12:38,876 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 11417 transitions. Word has length 94 [2019-11-16 00:12:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:38,876 INFO L462 AbstractCegarLoop]: Abstraction has 5226 states and 11417 transitions. [2019-11-16 00:12:38,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 11417 transitions. [2019-11-16 00:12:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:38,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:38,880 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:38,881 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1724237327, now seen corresponding path program 2 times [2019-11-16 00:12:38,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:38,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253826916] [2019-11-16 00:12:38,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:38,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:38,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:38,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253826916] [2019-11-16 00:12:38,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:38,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:12:38,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37421565] [2019-11-16 00:12:38,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:12:38,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:12:38,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:38,977 INFO L87 Difference]: Start difference. First operand 5226 states and 11417 transitions. Second operand 5 states. [2019-11-16 00:12:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:39,035 INFO L93 Difference]: Finished difference Result 5396 states and 11680 transitions. [2019-11-16 00:12:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:39,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:12:39,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:39,042 INFO L225 Difference]: With dead ends: 5396 [2019-11-16 00:12:39,042 INFO L226 Difference]: Without dead ends: 5396 [2019-11-16 00:12:39,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:12:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-11-16 00:12:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5291. [2019-11-16 00:12:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5291 states. [2019-11-16 00:12:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 11465 transitions. [2019-11-16 00:12:39,117 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 11465 transitions. Word has length 94 [2019-11-16 00:12:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:39,117 INFO L462 AbstractCegarLoop]: Abstraction has 5291 states and 11465 transitions. [2019-11-16 00:12:39,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:12:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 11465 transitions. [2019-11-16 00:12:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:12:39,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:39,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:39,124 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash 459439600, now seen corresponding path program 1 times [2019-11-16 00:12:39,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:39,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052795209] [2019-11-16 00:12:39,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:39,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:39,265 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:39,265 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:12:39,455 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:12:39,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:12:39 BasicIcfg [2019-11-16 00:12:39,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:12:39,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:39,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:39,458 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:39,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:54" (3/4) ... [2019-11-16 00:12:39,461 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:12:39,636 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7fecf5e1-e3d6-4dc9-ae87-b3739ebb52ab/bin/uautomizer/witness.graphml [2019-11-16 00:12:39,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:39,639 INFO L168 Benchmark]: Toolchain (without parser) took 47382.16 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 944.7 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,639 INFO L168 Benchmark]: CDTParser took 0.37 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:12:39,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 944.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.53 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:12:39,641 INFO L168 Benchmark]: Boogie Preprocessor took 47.71 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:12:39,643 INFO L168 Benchmark]: RCFGBuilder took 1135.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,643 INFO L168 Benchmark]: TraceAbstraction took 44996.01 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,645 INFO L168 Benchmark]: Witness Printer took 178.42 ms. Allocated memory is still 4.6 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:39,647 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.37 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 944.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.53 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 47.71 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 1135.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44996.01 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 178.42 ms. Allocated memory is still 4.6 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, 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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, 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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, 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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, 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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, 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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 217 locations, 3 error locations. Result: UNSAFE, OverallTime: 44.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9503 SDtfs, 10380 SDslu, 23032 SDs, 0 SdLazy, 9222 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 90 SyntacticMatches, 28 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71010occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 76845 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 510707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...