./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/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 b1c13a629685f920d5ce9018248d0b9f939b2481 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:33:01,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:33:01,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:33:01,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:33:01,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:33:01,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:33:01,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:33:01,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:33:01,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:33:01,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:33:01,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:33:01,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:33:01,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:33:01,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:33:01,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:33:01,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:33:01,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:33:01,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:33:01,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:33:01,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:33:01,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:33:01,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:33:01,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:33:01,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:33:01,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:33:01,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:33:01,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:33:01,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:33:01,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:33:01,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:33:01,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:33:01,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:33:01,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:33:01,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:33:01,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:33:01,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:33:01,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:33:01,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:33:01,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:33:01,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:33:01,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:33:01,282 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:33:01,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:33:01,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:33:01,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:33:01,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:33:01,299 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:33:01,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:33:01,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:33:01,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:33:01,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:33:01,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:33:01,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:33:01,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:33:01,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:33:01,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:33:01,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:33:01,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:33:01,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:33:01,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:33:01,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:33:01,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:33:01,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:33:01,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:33:01,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:33:01,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:33:01,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:33:01,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:33:01,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:33:01,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:33:01,305 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_8de7e1e4-3488-4b78-82f2-60dc8c57a174/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 -> b1c13a629685f920d5ce9018248d0b9f939b2481 [2019-11-15 22:33:01,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:33:01,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:33:01,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:33:01,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:33:01,350 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:33:01,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc.i [2019-11-15 22:33:01,412 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/data/65e71bcc6/ac0ad55f148e4631b350d921c9204a38/FLAGded7a91e8 [2019-11-15 22:33:01,946 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:33:01,947 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/sv-benchmarks/c/pthread-wmm/mix031_rmo.oepc.i [2019-11-15 22:33:01,963 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/data/65e71bcc6/ac0ad55f148e4631b350d921c9204a38/FLAGded7a91e8 [2019-11-15 22:33:02,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/data/65e71bcc6/ac0ad55f148e4631b350d921c9204a38 [2019-11-15 22:33:02,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:33:02,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:33:02,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:33:02,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:33:02,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:33:02,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:02,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e064e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02, skipping insertion in model container [2019-11-15 22:33:02,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:02,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:33:02,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:33:02,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:33:02,822 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:33:02,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:33:02,980 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:33:02,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02 WrapperNode [2019-11-15 22:33:02,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:33:02,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:33:02,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:33:02,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:33:02,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:33:03,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:33:03,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:33:03,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:33:03,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... [2019-11-15 22:33:03,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:33:03,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:33:03,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:33:03,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:33:03,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:33:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:33:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:33:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:33:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:33:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:33:03,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:33:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:33:03,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:33:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:33:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:33:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:33:03,208 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 22:33:04,060 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:33:04,061 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:33:04,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:33:04 BoogieIcfgContainer [2019-11-15 22:33:04,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:33:04,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:33:04,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:33:04,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:33:04,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:33:02" (1/3) ... [2019-11-15 22:33:04,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bde1a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:33:04, skipping insertion in model container [2019-11-15 22:33:04,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:33:02" (2/3) ... [2019-11-15 22:33:04,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bde1a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:33:04, skipping insertion in model container [2019-11-15 22:33:04,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:33:04" (3/3) ... [2019-11-15 22:33:04,070 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc.i [2019-11-15 22:33:04,109 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,110 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,110 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,110 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,110 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,110 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,110 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,111 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,111 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,111 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,111 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,111 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,111 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,112 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,113 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,114 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,115 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,115 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,119 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,119 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,119 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,120 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,120 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,120 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,121 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,123 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,124 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,125 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,126 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,127 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,128 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,138 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,139 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,140 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,140 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,140 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,140 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,141 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,141 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,141 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,142 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,142 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,142 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,142 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,143 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,143 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,143 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,143 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,144 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:33:04,163 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:33:04,164 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:33:04,173 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:33:04,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:33:04,215 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:33:04,216 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:33:04,216 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:33:04,216 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:33:04,216 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:33:04,216 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:33:04,217 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:33:04,217 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:33:04,240 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144 places, 182 transitions [2019-11-15 22:33:07,515 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-11-15 22:33:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-11-15 22:33:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:33:07,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:07,528 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] [2019-11-15 22:33:07,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -867481609, now seen corresponding path program 1 times [2019-11-15 22:33:07,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:07,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139667458] [2019-11-15 22:33:07,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:07,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:07,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:07,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139667458] [2019-11-15 22:33:07,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:07,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:33:07,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501621249] [2019-11-15 22:33:07,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:33:07,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:33:07,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:07,884 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-11-15 22:33:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:08,880 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-11-15 22:33:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:33:08,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 22:33:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:09,198 INFO L225 Difference]: With dead ends: 33594 [2019-11-15 22:33:09,199 INFO L226 Difference]: Without dead ends: 25706 [2019-11-15 22:33:09,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-11-15 22:33:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-11-15 22:33:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-11-15 22:33:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-11-15 22:33:11,159 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-11-15 22:33:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:11,161 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-11-15 22:33:11,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:33:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-11-15 22:33:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:33:11,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:11,177 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:11,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1683273565, now seen corresponding path program 1 times [2019-11-15 22:33:11,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:11,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910940328] [2019-11-15 22:33:11,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:11,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:11,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:11,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910940328] [2019-11-15 22:33:11,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:11,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:11,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702802830] [2019-11-15 22:33:11,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:11,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:11,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:11,384 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-11-15 22:33:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:12,706 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-11-15 22:33:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:12,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 22:33:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:12,919 INFO L225 Difference]: With dead ends: 41084 [2019-11-15 22:33:12,920 INFO L226 Difference]: Without dead ends: 40548 [2019-11-15 22:33:12,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-11-15 22:33:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-11-15 22:33:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-11-15 22:33:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-11-15 22:33:14,637 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-11-15 22:33:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:14,650 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-11-15 22:33:14,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-11-15 22:33:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:33:14,660 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:14,660 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:14,661 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash -506632681, now seen corresponding path program 1 times [2019-11-15 22:33:14,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:14,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101707523] [2019-11-15 22:33:14,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:14,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:14,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:14,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101707523] [2019-11-15 22:33:14,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:14,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:14,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093957175] [2019-11-15 22:33:14,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:14,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:14,797 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-11-15 22:33:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:15,471 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-11-15 22:33:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:15,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-15 22:33:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:15,854 INFO L225 Difference]: With dead ends: 49781 [2019-11-15 22:33:15,855 INFO L226 Difference]: Without dead ends: 49277 [2019-11-15 22:33:15,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-11-15 22:33:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-11-15 22:33:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-11-15 22:33:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-11-15 22:33:17,861 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-11-15 22:33:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:17,862 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-11-15 22:33:17,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-11-15 22:33:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:33:17,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:17,874 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:17,875 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:17,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:17,875 INFO L82 PathProgramCache]: Analyzing trace with hash -571471363, now seen corresponding path program 1 times [2019-11-15 22:33:17,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:17,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800120560] [2019-11-15 22:33:17,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:17,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:17,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:17,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800120560] [2019-11-15 22:33:17,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:17,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:33:17,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993659837] [2019-11-15 22:33:17,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:33:17,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:33:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:33:17,934 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-11-15 22:33:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:18,251 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-11-15 22:33:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:33:18,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 22:33:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:18,484 INFO L225 Difference]: With dead ends: 61090 [2019-11-15 22:33:18,484 INFO L226 Difference]: Without dead ends: 61090 [2019-11-15 22:33:18,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:33:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-11-15 22:33:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-11-15 22:33:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-11-15 22:33:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-11-15 22:33:20,404 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-11-15 22:33:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:20,405 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-11-15 22:33:20,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:33:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-11-15 22:33:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:33:20,425 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:20,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:20,426 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1136591846, now seen corresponding path program 1 times [2019-11-15 22:33:20,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:20,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094467764] [2019-11-15 22:33:20,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:20,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:20,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:20,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094467764] [2019-11-15 22:33:20,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:20,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:20,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895206199] [2019-11-15 22:33:20,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:20,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:20,591 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-11-15 22:33:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:21,729 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-11-15 22:33:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:21,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 22:33:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:21,873 INFO L225 Difference]: With dead ends: 63759 [2019-11-15 22:33:21,873 INFO L226 Difference]: Without dead ends: 63759 [2019-11-15 22:33:21,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-11-15 22:33:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-11-15 22:33:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-11-15 22:33:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-11-15 22:33:24,255 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-11-15 22:33:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:24,255 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-11-15 22:33:24,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-11-15 22:33:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:33:24,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:24,277 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:24,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash -660359513, now seen corresponding path program 1 times [2019-11-15 22:33:24,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:24,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150897704] [2019-11-15 22:33:24,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:24,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:24,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:24,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150897704] [2019-11-15 22:33:24,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:24,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:33:24,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274985640] [2019-11-15 22:33:24,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:33:24,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:33:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:24,460 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-11-15 22:33:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:26,032 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-11-15 22:33:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:33:26,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 22:33:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:26,276 INFO L225 Difference]: With dead ends: 83688 [2019-11-15 22:33:26,276 INFO L226 Difference]: Without dead ends: 83688 [2019-11-15 22:33:26,277 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-15 22:33:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-11-15 22:33:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-11-15 22:33:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-11-15 22:33:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-11-15 22:33:32,645 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-11-15 22:33:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:32,646 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-11-15 22:33:32,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:33:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-11-15 22:33:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:33:32,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:32,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:32,665 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash 227144168, now seen corresponding path program 1 times [2019-11-15 22:33:32,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:32,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057509902] [2019-11-15 22:33:32,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:32,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:32,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:32,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057509902] [2019-11-15 22:33:32,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:32,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:33:32,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754373579] [2019-11-15 22:33:32,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:33:32,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:33:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:32,761 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 4 states. [2019-11-15 22:33:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:32,854 INFO L93 Difference]: Finished difference Result 12162 states and 37832 transitions. [2019-11-15 22:33:32,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:33:32,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 22:33:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:32,877 INFO L225 Difference]: With dead ends: 12162 [2019-11-15 22:33:32,878 INFO L226 Difference]: Without dead ends: 10677 [2019-11-15 22:33:32,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10677 states. [2019-11-15 22:33:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10677 to 10628. [2019-11-15 22:33:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10628 states. [2019-11-15 22:33:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10628 states to 10628 states and 32594 transitions. [2019-11-15 22:33:33,099 INFO L78 Accepts]: Start accepts. Automaton has 10628 states and 32594 transitions. Word has length 56 [2019-11-15 22:33:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:33,099 INFO L462 AbstractCegarLoop]: Abstraction has 10628 states and 32594 transitions. [2019-11-15 22:33:33,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:33:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 10628 states and 32594 transitions. [2019-11-15 22:33:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:33:33,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:33,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:33,102 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1710341576, now seen corresponding path program 1 times [2019-11-15 22:33:33,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:33,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668852056] [2019-11-15 22:33:33,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:33,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:33,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:33,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668852056] [2019-11-15 22:33:33,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:33,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:33,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962334788] [2019-11-15 22:33:33,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:33,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:33,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:33,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:33,223 INFO L87 Difference]: Start difference. First operand 10628 states and 32594 transitions. Second operand 6 states. [2019-11-15 22:33:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:33,768 INFO L93 Difference]: Finished difference Result 13185 states and 39875 transitions. [2019-11-15 22:33:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:33:33,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 22:33:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:33,788 INFO L225 Difference]: With dead ends: 13185 [2019-11-15 22:33:33,788 INFO L226 Difference]: Without dead ends: 13122 [2019-11-15 22:33:33,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:33:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13122 states. [2019-11-15 22:33:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13122 to 11051. [2019-11-15 22:33:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11051 states. [2019-11-15 22:33:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11051 states to 11051 states and 33788 transitions. [2019-11-15 22:33:33,962 INFO L78 Accepts]: Start accepts. Automaton has 11051 states and 33788 transitions. Word has length 56 [2019-11-15 22:33:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:33,962 INFO L462 AbstractCegarLoop]: Abstraction has 11051 states and 33788 transitions. [2019-11-15 22:33:33,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11051 states and 33788 transitions. [2019-11-15 22:33:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:33:33,966 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:33,966 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] [2019-11-15 22:33:33,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133860, now seen corresponding path program 1 times [2019-11-15 22:33:33,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:33,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468192263] [2019-11-15 22:33:33,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:33,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:33,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:34,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468192263] [2019-11-15 22:33:34,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:34,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:33:34,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462321590] [2019-11-15 22:33:34,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:33:34,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:33:34,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:34,037 INFO L87 Difference]: Start difference. First operand 11051 states and 33788 transitions. Second operand 4 states. [2019-11-15 22:33:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:34,192 INFO L93 Difference]: Finished difference Result 12865 states and 39394 transitions. [2019-11-15 22:33:34,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:33:34,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 22:33:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:34,212 INFO L225 Difference]: With dead ends: 12865 [2019-11-15 22:33:34,212 INFO L226 Difference]: Without dead ends: 12865 [2019-11-15 22:33:34,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12865 states. [2019-11-15 22:33:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12865 to 11696. [2019-11-15 22:33:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11696 states. [2019-11-15 22:33:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 35765 transitions. [2019-11-15 22:33:34,392 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 35765 transitions. Word has length 64 [2019-11-15 22:33:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:34,392 INFO L462 AbstractCegarLoop]: Abstraction has 11696 states and 35765 transitions. [2019-11-15 22:33:34,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:33:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 35765 transitions. [2019-11-15 22:33:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:33:34,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:34,396 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] [2019-11-15 22:33:34,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1341023101, now seen corresponding path program 1 times [2019-11-15 22:33:34,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:34,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649533573] [2019-11-15 22:33:34,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:34,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:34,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:34,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649533573] [2019-11-15 22:33:34,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:34,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:34,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281331445] [2019-11-15 22:33:34,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:34,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:34,496 INFO L87 Difference]: Start difference. First operand 11696 states and 35765 transitions. Second operand 6 states. [2019-11-15 22:33:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:34,989 INFO L93 Difference]: Finished difference Result 14222 states and 42863 transitions. [2019-11-15 22:33:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:33:34,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 22:33:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:35,011 INFO L225 Difference]: With dead ends: 14222 [2019-11-15 22:33:35,011 INFO L226 Difference]: Without dead ends: 14161 [2019-11-15 22:33:35,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:33:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2019-11-15 22:33:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13464. [2019-11-15 22:33:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13464 states. [2019-11-15 22:33:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 40782 transitions. [2019-11-15 22:33:35,254 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 40782 transitions. Word has length 64 [2019-11-15 22:33:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:35,255 INFO L462 AbstractCegarLoop]: Abstraction has 13464 states and 40782 transitions. [2019-11-15 22:33:35,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 40782 transitions. [2019-11-15 22:33:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:33:35,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:35,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:35,261 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 733516216, now seen corresponding path program 1 times [2019-11-15 22:33:35,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:35,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435711468] [2019-11-15 22:33:35,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:35,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:35,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:35,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435711468] [2019-11-15 22:33:35,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:35,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:33:35,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154497133] [2019-11-15 22:33:35,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:33:35,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:33:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:35,326 INFO L87 Difference]: Start difference. First operand 13464 states and 40782 transitions. Second operand 4 states. [2019-11-15 22:33:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:35,669 INFO L93 Difference]: Finished difference Result 16506 states and 49374 transitions. [2019-11-15 22:33:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:33:35,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:33:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:35,699 INFO L225 Difference]: With dead ends: 16506 [2019-11-15 22:33:35,699 INFO L226 Difference]: Without dead ends: 16506 [2019-11-15 22:33:35,700 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-15 22:33:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2019-11-15 22:33:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 14985. [2019-11-15 22:33:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14985 states. [2019-11-15 22:33:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14985 states to 14985 states and 44963 transitions. [2019-11-15 22:33:35,945 INFO L78 Accepts]: Start accepts. Automaton has 14985 states and 44963 transitions. Word has length 68 [2019-11-15 22:33:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:35,945 INFO L462 AbstractCegarLoop]: Abstraction has 14985 states and 44963 transitions. [2019-11-15 22:33:35,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:33:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 14985 states and 44963 transitions. [2019-11-15 22:33:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:33:35,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:35,954 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:35,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1343693127, now seen corresponding path program 1 times [2019-11-15 22:33:35,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:35,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575936094] [2019-11-15 22:33:35,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:35,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:35,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:35,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575936094] [2019-11-15 22:33:35,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:35,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:33:35,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134592461] [2019-11-15 22:33:35,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:33:35,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:35,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:33:35,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:33:35,999 INFO L87 Difference]: Start difference. First operand 14985 states and 44963 transitions. Second operand 3 states. [2019-11-15 22:33:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:36,221 INFO L93 Difference]: Finished difference Result 15533 states and 46406 transitions. [2019-11-15 22:33:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:33:36,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 22:33:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:36,244 INFO L225 Difference]: With dead ends: 15533 [2019-11-15 22:33:36,245 INFO L226 Difference]: Without dead ends: 15533 [2019-11-15 22:33:36,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:33:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15533 states. [2019-11-15 22:33:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15533 to 15279. [2019-11-15 22:33:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15279 states. [2019-11-15 22:33:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15279 states to 15279 states and 45731 transitions. [2019-11-15 22:33:36,469 INFO L78 Accepts]: Start accepts. Automaton has 15279 states and 45731 transitions. Word has length 68 [2019-11-15 22:33:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:36,469 INFO L462 AbstractCegarLoop]: Abstraction has 15279 states and 45731 transitions. [2019-11-15 22:33:36,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:33:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15279 states and 45731 transitions. [2019-11-15 22:33:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:36,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:36,478 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:36,479 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1828943938, now seen corresponding path program 1 times [2019-11-15 22:33:36,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:36,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834477792] [2019-11-15 22:33:36,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:36,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:36,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:36,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834477792] [2019-11-15 22:33:36,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:36,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:33:36,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475505870] [2019-11-15 22:33:36,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:33:36,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:33:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:36,608 INFO L87 Difference]: Start difference. First operand 15279 states and 45731 transitions. Second operand 8 states. [2019-11-15 22:33:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:39,513 INFO L93 Difference]: Finished difference Result 48056 states and 141062 transitions. [2019-11-15 22:33:39,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:33:39,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-11-15 22:33:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:39,585 INFO L225 Difference]: With dead ends: 48056 [2019-11-15 22:33:39,585 INFO L226 Difference]: Without dead ends: 47906 [2019-11-15 22:33:39,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:33:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47906 states. [2019-11-15 22:33:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47906 to 21960. [2019-11-15 22:33:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21960 states. [2019-11-15 22:33:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21960 states to 21960 states and 65743 transitions. [2019-11-15 22:33:40,084 INFO L78 Accepts]: Start accepts. Automaton has 21960 states and 65743 transitions. Word has length 70 [2019-11-15 22:33:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:40,084 INFO L462 AbstractCegarLoop]: Abstraction has 21960 states and 65743 transitions. [2019-11-15 22:33:40,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:33:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 21960 states and 65743 transitions. [2019-11-15 22:33:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:40,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:40,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:40,098 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash -21489475, now seen corresponding path program 1 times [2019-11-15 22:33:40,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:40,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386908482] [2019-11-15 22:33:40,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:40,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:40,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386908482] [2019-11-15 22:33:40,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:40,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:40,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906274208] [2019-11-15 22:33:40,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:40,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:40,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:40,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:40,210 INFO L87 Difference]: Start difference. First operand 21960 states and 65743 transitions. Second operand 6 states. [2019-11-15 22:33:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:40,859 INFO L93 Difference]: Finished difference Result 22857 states and 67869 transitions. [2019-11-15 22:33:40,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:40,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 22:33:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:40,892 INFO L225 Difference]: With dead ends: 22857 [2019-11-15 22:33:40,892 INFO L226 Difference]: Without dead ends: 22857 [2019-11-15 22:33:40,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-11-15 22:33:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 22415. [2019-11-15 22:33:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22415 states. [2019-11-15 22:33:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22415 states to 22415 states and 66697 transitions. [2019-11-15 22:33:41,225 INFO L78 Accepts]: Start accepts. Automaton has 22415 states and 66697 transitions. Word has length 70 [2019-11-15 22:33:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:41,226 INFO L462 AbstractCegarLoop]: Abstraction has 22415 states and 66697 transitions. [2019-11-15 22:33:41,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 22415 states and 66697 transitions. [2019-11-15 22:33:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:41,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:41,242 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:41,242 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2098698818, now seen corresponding path program 1 times [2019-11-15 22:33:41,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:41,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947176383] [2019-11-15 22:33:41,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:41,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:41,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947176383] [2019-11-15 22:33:41,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:41,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:41,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625141927] [2019-11-15 22:33:41,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:41,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:41,342 INFO L87 Difference]: Start difference. First operand 22415 states and 66697 transitions. Second operand 6 states. [2019-11-15 22:33:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:41,823 INFO L93 Difference]: Finished difference Result 20201 states and 58714 transitions. [2019-11-15 22:33:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:33:41,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 22:33:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:41,850 INFO L225 Difference]: With dead ends: 20201 [2019-11-15 22:33:41,850 INFO L226 Difference]: Without dead ends: 20201 [2019-11-15 22:33:41,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:33:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20201 states. [2019-11-15 22:33:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20201 to 19005. [2019-11-15 22:33:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19005 states. [2019-11-15 22:33:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19005 states to 19005 states and 55678 transitions. [2019-11-15 22:33:42,131 INFO L78 Accepts]: Start accepts. Automaton has 19005 states and 55678 transitions. Word has length 70 [2019-11-15 22:33:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:42,131 INFO L462 AbstractCegarLoop]: Abstraction has 19005 states and 55678 transitions. [2019-11-15 22:33:42,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19005 states and 55678 transitions. [2019-11-15 22:33:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:42,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:42,143 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:42,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash 600164928, now seen corresponding path program 1 times [2019-11-15 22:33:42,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:42,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304662603] [2019-11-15 22:33:42,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:42,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:42,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:42,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304662603] [2019-11-15 22:33:42,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:42,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:33:42,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563136070] [2019-11-15 22:33:42,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:33:42,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:33:42,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:42,219 INFO L87 Difference]: Start difference. First operand 19005 states and 55678 transitions. Second operand 4 states. [2019-11-15 22:33:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:43,051 INFO L93 Difference]: Finished difference Result 25536 states and 75191 transitions. [2019-11-15 22:33:43,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:33:43,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-15 22:33:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:43,092 INFO L225 Difference]: With dead ends: 25536 [2019-11-15 22:33:43,092 INFO L226 Difference]: Without dead ends: 25401 [2019-11-15 22:33:43,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25401 states. [2019-11-15 22:33:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25401 to 22554. [2019-11-15 22:33:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22554 states. [2019-11-15 22:33:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22554 states to 22554 states and 66526 transitions. [2019-11-15 22:33:43,449 INFO L78 Accepts]: Start accepts. Automaton has 22554 states and 66526 transitions. Word has length 70 [2019-11-15 22:33:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:43,449 INFO L462 AbstractCegarLoop]: Abstraction has 22554 states and 66526 transitions. [2019-11-15 22:33:43,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:33:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 22554 states and 66526 transitions. [2019-11-15 22:33:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:43,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:43,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:43,459 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1887347905, now seen corresponding path program 1 times [2019-11-15 22:33:43,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:43,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483571623] [2019-11-15 22:33:43,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:43,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:43,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:43,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483571623] [2019-11-15 22:33:43,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:43,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:43,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78442975] [2019-11-15 22:33:43,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:43,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:43,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:43,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:43,523 INFO L87 Difference]: Start difference. First operand 22554 states and 66526 transitions. Second operand 5 states. [2019-11-15 22:33:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:44,122 INFO L93 Difference]: Finished difference Result 32545 states and 94756 transitions. [2019-11-15 22:33:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:44,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 22:33:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:44,173 INFO L225 Difference]: With dead ends: 32545 [2019-11-15 22:33:44,173 INFO L226 Difference]: Without dead ends: 32443 [2019-11-15 22:33:44,173 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-15 22:33:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32443 states. [2019-11-15 22:33:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32443 to 26202. [2019-11-15 22:33:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26202 states. [2019-11-15 22:33:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26202 states to 26202 states and 76700 transitions. [2019-11-15 22:33:45,078 INFO L78 Accepts]: Start accepts. Automaton has 26202 states and 76700 transitions. Word has length 70 [2019-11-15 22:33:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:45,078 INFO L462 AbstractCegarLoop]: Abstraction has 26202 states and 76700 transitions. [2019-11-15 22:33:45,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 26202 states and 76700 transitions. [2019-11-15 22:33:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:45,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:45,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:45,091 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1196786431, now seen corresponding path program 1 times [2019-11-15 22:33:45,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:45,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634402608] [2019-11-15 22:33:45,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:45,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:45,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:45,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634402608] [2019-11-15 22:33:45,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:45,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:33:45,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444252851] [2019-11-15 22:33:45,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:33:45,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:33:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:45,351 INFO L87 Difference]: Start difference. First operand 26202 states and 76700 transitions. Second operand 7 states. [2019-11-15 22:33:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:46,066 INFO L93 Difference]: Finished difference Result 21955 states and 61128 transitions. [2019-11-15 22:33:46,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:33:46,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-15 22:33:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:46,092 INFO L225 Difference]: With dead ends: 21955 [2019-11-15 22:33:46,093 INFO L226 Difference]: Without dead ends: 21955 [2019-11-15 22:33:46,093 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-15 22:33:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21955 states. [2019-11-15 22:33:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21955 to 17956. [2019-11-15 22:33:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17956 states. [2019-11-15 22:33:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17956 states to 17956 states and 49940 transitions. [2019-11-15 22:33:46,360 INFO L78 Accepts]: Start accepts. Automaton has 17956 states and 49940 transitions. Word has length 70 [2019-11-15 22:33:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:46,361 INFO L462 AbstractCegarLoop]: Abstraction has 17956 states and 49940 transitions. [2019-11-15 22:33:46,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:33:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17956 states and 49940 transitions. [2019-11-15 22:33:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:46,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:46,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:46,368 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:46,369 INFO L82 PathProgramCache]: Analyzing trace with hash -309282750, now seen corresponding path program 1 times [2019-11-15 22:33:46,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:46,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302097328] [2019-11-15 22:33:46,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:46,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:46,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:46,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302097328] [2019-11-15 22:33:46,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:46,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:46,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884736738] [2019-11-15 22:33:46,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:46,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:46,483 INFO L87 Difference]: Start difference. First operand 17956 states and 49940 transitions. Second operand 5 states. [2019-11-15 22:33:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:46,570 INFO L93 Difference]: Finished difference Result 5509 states and 13001 transitions. [2019-11-15 22:33:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:33:46,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 22:33:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:46,575 INFO L225 Difference]: With dead ends: 5509 [2019-11-15 22:33:46,575 INFO L226 Difference]: Without dead ends: 4699 [2019-11-15 22:33:46,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2019-11-15 22:33:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4015. [2019-11-15 22:33:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4015 states. [2019-11-15 22:33:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 9282 transitions. [2019-11-15 22:33:46,623 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 9282 transitions. Word has length 70 [2019-11-15 22:33:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:46,624 INFO L462 AbstractCegarLoop]: Abstraction has 4015 states and 9282 transitions. [2019-11-15 22:33:46,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 9282 transitions. [2019-11-15 22:33:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:33:46,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:46,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:46,628 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash -687461772, now seen corresponding path program 1 times [2019-11-15 22:33:46,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:46,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470323194] [2019-11-15 22:33:46,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:46,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:46,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:46,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470323194] [2019-11-15 22:33:46,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:46,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:33:46,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861500446] [2019-11-15 22:33:46,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:33:46,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:33:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:33:46,669 INFO L87 Difference]: Start difference. First operand 4015 states and 9282 transitions. Second operand 3 states. [2019-11-15 22:33:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:46,711 INFO L93 Difference]: Finished difference Result 4980 states and 11347 transitions. [2019-11-15 22:33:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:33:46,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 22:33:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:46,715 INFO L225 Difference]: With dead ends: 4980 [2019-11-15 22:33:46,715 INFO L226 Difference]: Without dead ends: 4980 [2019-11-15 22:33:46,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:33:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-11-15 22:33:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 3950. [2019-11-15 22:33:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-11-15 22:33:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 8915 transitions. [2019-11-15 22:33:46,763 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 8915 transitions. Word has length 70 [2019-11-15 22:33:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:46,764 INFO L462 AbstractCegarLoop]: Abstraction has 3950 states and 8915 transitions. [2019-11-15 22:33:46,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:33:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 8915 transitions. [2019-11-15 22:33:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:33:46,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:46,767 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] [2019-11-15 22:33:46,767 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:46,768 INFO L82 PathProgramCache]: Analyzing trace with hash -61024697, now seen corresponding path program 1 times [2019-11-15 22:33:46,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:46,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874438139] [2019-11-15 22:33:46,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:46,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:46,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:46,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874438139] [2019-11-15 22:33:46,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:46,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:46,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944001643] [2019-11-15 22:33:46,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:46,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:46,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:46,837 INFO L87 Difference]: Start difference. First operand 3950 states and 8915 transitions. Second operand 5 states. [2019-11-15 22:33:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:47,066 INFO L93 Difference]: Finished difference Result 4879 states and 11065 transitions. [2019-11-15 22:33:47,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:33:47,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-11-15 22:33:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:47,073 INFO L225 Difference]: With dead ends: 4879 [2019-11-15 22:33:47,073 INFO L226 Difference]: Without dead ends: 4879 [2019-11-15 22:33:47,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:33:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-11-15 22:33:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4516. [2019-11-15 22:33:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4516 states. [2019-11-15 22:33:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 10194 transitions. [2019-11-15 22:33:47,147 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 10194 transitions. Word has length 76 [2019-11-15 22:33:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:47,147 INFO L462 AbstractCegarLoop]: Abstraction has 4516 states and 10194 transitions. [2019-11-15 22:33:47,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 10194 transitions. [2019-11-15 22:33:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:33:47,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:47,151 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] [2019-11-15 22:33:47,152 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1681785638, now seen corresponding path program 1 times [2019-11-15 22:33:47,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:47,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259430227] [2019-11-15 22:33:47,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:47,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:47,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:47,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259430227] [2019-11-15 22:33:47,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:47,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:33:47,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325050440] [2019-11-15 22:33:47,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:33:47,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:47,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:33:47,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:47,254 INFO L87 Difference]: Start difference. First operand 4516 states and 10194 transitions. Second operand 7 states. [2019-11-15 22:33:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:47,880 INFO L93 Difference]: Finished difference Result 5157 states and 11533 transitions. [2019-11-15 22:33:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:33:47,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-11-15 22:33:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:47,887 INFO L225 Difference]: With dead ends: 5157 [2019-11-15 22:33:47,887 INFO L226 Difference]: Without dead ends: 5104 [2019-11-15 22:33:47,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:33:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2019-11-15 22:33:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 4540. [2019-11-15 22:33:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4540 states. [2019-11-15 22:33:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 10171 transitions. [2019-11-15 22:33:47,961 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 10171 transitions. Word has length 76 [2019-11-15 22:33:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:47,962 INFO L462 AbstractCegarLoop]: Abstraction has 4540 states and 10171 transitions. [2019-11-15 22:33:47,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:33:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 10171 transitions. [2019-11-15 22:33:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:33:47,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:47,968 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:47,968 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 840189516, now seen corresponding path program 1 times [2019-11-15 22:33:47,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:47,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87305508] [2019-11-15 22:33:47,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:47,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:47,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:48,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87305508] [2019-11-15 22:33:48,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:48,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:33:48,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196208881] [2019-11-15 22:33:48,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:33:48,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:33:48,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:33:48,061 INFO L87 Difference]: Start difference. First operand 4540 states and 10171 transitions. Second operand 4 states. [2019-11-15 22:33:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:48,176 INFO L93 Difference]: Finished difference Result 5402 states and 12006 transitions. [2019-11-15 22:33:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:33:48,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:33:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:48,183 INFO L225 Difference]: With dead ends: 5402 [2019-11-15 22:33:48,183 INFO L226 Difference]: Without dead ends: 5402 [2019-11-15 22:33:48,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-11-15 22:33:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4927. [2019-11-15 22:33:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4927 states. [2019-11-15 22:33:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 10984 transitions. [2019-11-15 22:33:48,257 INFO L78 Accepts]: Start accepts. Automaton has 4927 states and 10984 transitions. Word has length 97 [2019-11-15 22:33:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:48,258 INFO L462 AbstractCegarLoop]: Abstraction has 4927 states and 10984 transitions. [2019-11-15 22:33:48,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:33:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4927 states and 10984 transitions. [2019-11-15 22:33:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:48,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:48,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:48,264 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash 765656030, now seen corresponding path program 1 times [2019-11-15 22:33:48,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:48,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406646829] [2019-11-15 22:33:48,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:48,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:48,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:48,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406646829] [2019-11-15 22:33:48,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:48,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:48,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910472769] [2019-11-15 22:33:48,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:48,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:48,384 INFO L87 Difference]: Start difference. First operand 4927 states and 10984 transitions. Second operand 6 states. [2019-11-15 22:33:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:49,390 INFO L93 Difference]: Finished difference Result 7374 states and 16549 transitions. [2019-11-15 22:33:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:33:49,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 22:33:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:49,400 INFO L225 Difference]: With dead ends: 7374 [2019-11-15 22:33:49,400 INFO L226 Difference]: Without dead ends: 7374 [2019-11-15 22:33:49,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:33:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7374 states. [2019-11-15 22:33:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7374 to 5610. [2019-11-15 22:33:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2019-11-15 22:33:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 12651 transitions. [2019-11-15 22:33:49,507 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 12651 transitions. Word has length 99 [2019-11-15 22:33:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:49,508 INFO L462 AbstractCegarLoop]: Abstraction has 5610 states and 12651 transitions. [2019-11-15 22:33:49,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 12651 transitions. [2019-11-15 22:33:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:49,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:49,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:49,516 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:49,517 INFO L82 PathProgramCache]: Analyzing trace with hash 776972157, now seen corresponding path program 1 times [2019-11-15 22:33:49,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:49,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95347510] [2019-11-15 22:33:49,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:49,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:49,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:49,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95347510] [2019-11-15 22:33:49,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:49,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:33:49,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276835205] [2019-11-15 22:33:49,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:33:49,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:49,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:33:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:49,678 INFO L87 Difference]: Start difference. First operand 5610 states and 12651 transitions. Second operand 7 states. [2019-11-15 22:33:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:51,368 INFO L93 Difference]: Finished difference Result 8011 states and 17855 transitions. [2019-11-15 22:33:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:33:51,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-11-15 22:33:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:51,376 INFO L225 Difference]: With dead ends: 8011 [2019-11-15 22:33:51,376 INFO L226 Difference]: Without dead ends: 7938 [2019-11-15 22:33:51,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:33:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states. [2019-11-15 22:33:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 6560. [2019-11-15 22:33:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6560 states. [2019-11-15 22:33:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 14734 transitions. [2019-11-15 22:33:51,462 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 14734 transitions. Word has length 99 [2019-11-15 22:33:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:51,463 INFO L462 AbstractCegarLoop]: Abstraction has 6560 states and 14734 transitions. [2019-11-15 22:33:51,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:33:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 14734 transitions. [2019-11-15 22:33:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:51,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:51,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:51,469 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1300237186, now seen corresponding path program 1 times [2019-11-15 22:33:51,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:51,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341001323] [2019-11-15 22:33:51,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:51,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:51,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:51,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341001323] [2019-11-15 22:33:51,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:51,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:51,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501483770] [2019-11-15 22:33:51,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:51,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:51,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:51,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:51,676 INFO L87 Difference]: Start difference. First operand 6560 states and 14734 transitions. Second operand 6 states. [2019-11-15 22:33:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:51,977 INFO L93 Difference]: Finished difference Result 5896 states and 12970 transitions. [2019-11-15 22:33:51,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:33:51,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 22:33:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:51,985 INFO L225 Difference]: With dead ends: 5896 [2019-11-15 22:33:51,985 INFO L226 Difference]: Without dead ends: 5860 [2019-11-15 22:33:51,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2019-11-15 22:33:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 5095. [2019-11-15 22:33:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5095 states. [2019-11-15 22:33:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 11251 transitions. [2019-11-15 22:33:52,068 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 11251 transitions. Word has length 99 [2019-11-15 22:33:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:52,068 INFO L462 AbstractCegarLoop]: Abstraction has 5095 states and 11251 transitions. [2019-11-15 22:33:52,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 11251 transitions. [2019-11-15 22:33:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:52,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:52,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:52,075 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1123602106, now seen corresponding path program 1 times [2019-11-15 22:33:52,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:52,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582489237] [2019-11-15 22:33:52,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:52,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:52,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:52,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582489237] [2019-11-15 22:33:52,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:52,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:52,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191383124] [2019-11-15 22:33:52,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:52,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:52,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:52,155 INFO L87 Difference]: Start difference. First operand 5095 states and 11251 transitions. Second operand 5 states. [2019-11-15 22:33:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:52,278 INFO L93 Difference]: Finished difference Result 5603 states and 12349 transitions. [2019-11-15 22:33:52,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:33:52,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 22:33:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:52,284 INFO L225 Difference]: With dead ends: 5603 [2019-11-15 22:33:52,285 INFO L226 Difference]: Without dead ends: 5603 [2019-11-15 22:33:52,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:33:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-11-15 22:33:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 4471. [2019-11-15 22:33:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-15 22:33:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 9854 transitions. [2019-11-15 22:33:52,360 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 9854 transitions. Word has length 99 [2019-11-15 22:33:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:52,360 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 9854 transitions. [2019-11-15 22:33:52,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 9854 transitions. [2019-11-15 22:33:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:52,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:52,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:52,367 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2145873191, now seen corresponding path program 1 times [2019-11-15 22:33:52,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:52,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488958991] [2019-11-15 22:33:52,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:52,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:52,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:52,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488958991] [2019-11-15 22:33:52,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:52,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:52,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860999220] [2019-11-15 22:33:52,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:52,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:52,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:52,510 INFO L87 Difference]: Start difference. First operand 4471 states and 9854 transitions. Second operand 5 states. [2019-11-15 22:33:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:53,138 INFO L93 Difference]: Finished difference Result 5359 states and 11752 transitions. [2019-11-15 22:33:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:33:53,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 22:33:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:53,145 INFO L225 Difference]: With dead ends: 5359 [2019-11-15 22:33:53,145 INFO L226 Difference]: Without dead ends: 5299 [2019-11-15 22:33:53,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-11-15 22:33:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4997. [2019-11-15 22:33:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4997 states. [2019-11-15 22:33:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 10993 transitions. [2019-11-15 22:33:53,211 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 10993 transitions. Word has length 99 [2019-11-15 22:33:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:53,211 INFO L462 AbstractCegarLoop]: Abstraction has 4997 states and 10993 transitions. [2019-11-15 22:33:53,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 10993 transitions. [2019-11-15 22:33:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:53,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:53,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:53,216 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash 418154712, now seen corresponding path program 1 times [2019-11-15 22:33:53,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:53,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296684680] [2019-11-15 22:33:53,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:53,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:53,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:53,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-15 22:33:53,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296684680] [2019-11-15 22:33:53,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:53,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:33:53,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92888561] [2019-11-15 22:33:53,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:33:53,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:33:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:33:53,292 INFO L87 Difference]: Start difference. First operand 4997 states and 10993 transitions. Second operand 5 states. [2019-11-15 22:33:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:53,616 INFO L93 Difference]: Finished difference Result 6202 states and 13442 transitions. [2019-11-15 22:33:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:53,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 22:33:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:53,622 INFO L225 Difference]: With dead ends: 6202 [2019-11-15 22:33:53,622 INFO L226 Difference]: Without dead ends: 6158 [2019-11-15 22:33:53,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-11-15 22:33:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 5044. [2019-11-15 22:33:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2019-11-15 22:33:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 11069 transitions. [2019-11-15 22:33:53,685 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 11069 transitions. Word has length 99 [2019-11-15 22:33:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:53,686 INFO L462 AbstractCegarLoop]: Abstraction has 5044 states and 11069 transitions. [2019-11-15 22:33:53,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:33:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 11069 transitions. [2019-11-15 22:33:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:53,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:53,693 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:53,693 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -965952934, now seen corresponding path program 2 times [2019-11-15 22:33:53,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:53,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064524677] [2019-11-15 22:33:53,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:53,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:53,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:53,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064524677] [2019-11-15 22:33:53,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:53,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:33:53,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79697548] [2019-11-15 22:33:53,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:33:53,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:33:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:33:53,795 INFO L87 Difference]: Start difference. First operand 5044 states and 11069 transitions. Second operand 6 states. [2019-11-15 22:33:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:54,087 INFO L93 Difference]: Finished difference Result 5300 states and 11591 transitions. [2019-11-15 22:33:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:33:54,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 22:33:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:54,094 INFO L225 Difference]: With dead ends: 5300 [2019-11-15 22:33:54,094 INFO L226 Difference]: Without dead ends: 5300 [2019-11-15 22:33:54,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2019-11-15 22:33:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4986. [2019-11-15 22:33:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-11-15 22:33:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 10943 transitions. [2019-11-15 22:33:54,175 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 10943 transitions. Word has length 99 [2019-11-15 22:33:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:54,175 INFO L462 AbstractCegarLoop]: Abstraction has 4986 states and 10943 transitions. [2019-11-15 22:33:54,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:33:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 10943 transitions. [2019-11-15 22:33:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:54,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:54,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:54,183 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 332566813, now seen corresponding path program 1 times [2019-11-15 22:33:54,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:54,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753358090] [2019-11-15 22:33:54,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:54,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:54,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:33:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:33:54,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753358090] [2019-11-15 22:33:54,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:54,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:33:54,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112386372] [2019-11-15 22:33:54,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:33:54,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:33:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:33:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:33:54,398 INFO L87 Difference]: Start difference. First operand 4986 states and 10943 transitions. Second operand 8 states. [2019-11-15 22:33:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:33:54,853 INFO L93 Difference]: Finished difference Result 5774 states and 12551 transitions. [2019-11-15 22:33:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:33:54,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-11-15 22:33:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:33:54,859 INFO L225 Difference]: With dead ends: 5774 [2019-11-15 22:33:54,859 INFO L226 Difference]: Without dead ends: 5774 [2019-11-15 22:33:54,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:33:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-11-15 22:33:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5294. [2019-11-15 22:33:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2019-11-15 22:33:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 11562 transitions. [2019-11-15 22:33:54,927 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 11562 transitions. Word has length 99 [2019-11-15 22:33:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:33:54,928 INFO L462 AbstractCegarLoop]: Abstraction has 5294 states and 11562 transitions. [2019-11-15 22:33:54,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:33:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 11562 transitions. [2019-11-15 22:33:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:33:54,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:33:54,937 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:33:54,938 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:33:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:33:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1220070494, now seen corresponding path program 1 times [2019-11-15 22:33:54,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:33:54,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179632997] [2019-11-15 22:33:54,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:54,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:33:54,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:33:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:33:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:33:55,047 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:33:55,047 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:33:55,272 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:33:55,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:33:55 BasicIcfg [2019-11-15 22:33:55,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:33:55,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:33:55,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:33:55,276 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:33:55,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:33:04" (3/4) ... [2019-11-15 22:33:55,279 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:33:55,505 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8de7e1e4-3488-4b78-82f2-60dc8c57a174/bin/uautomizer/witness.graphml [2019-11-15 22:33:55,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:33:55,509 INFO L168 Benchmark]: Toolchain (without parser) took 53256.46 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 940.8 MB in the beginning and 1.7 GB in the end (delta: -775.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-15 22:33:55,509 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:33:55,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:55,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.97 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:55,510 INFO L168 Benchmark]: Boogie Preprocessor took 41.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:33:55,511 INFO L168 Benchmark]: RCFGBuilder took 970.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:55,513 INFO L168 Benchmark]: TraceAbstraction took 51211.94 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -747.0 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:33:55,514 INFO L168 Benchmark]: Witness Printer took 230.69 ms. Allocated memory is still 4.8 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:33:55,516 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 729.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.97 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.02 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 970.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51211.94 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -747.0 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 230.69 ms. Allocated memory is still 4.8 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t841; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L815] 0 pthread_t t842; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. Result: UNSAFE, OverallTime: 51.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9324 SDtfs, 11581 SDslu, 18692 SDs, 0 SdLazy, 9183 SolverSat, 578 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 91 SyntacticMatches, 17 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred 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: 21.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 94565 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2376 NumberOfCodeBlocks, 2376 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2246 ConstructedInterpolants, 0 QuantifiedInterpolants, 435985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...