./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_power.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_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/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 7082604ba6f5c2a79646cd2200d1a5c8e7fdb3ae .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:15:44,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:15:44,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:15:44,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:15:44,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:15:44,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:15:44,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:15:44,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:15:44,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:15:44,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:15:44,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:15:44,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:15:44,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:15:44,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:15:44,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:15:44,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:15:44,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:15:44,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:15:44,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:15:44,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:15:44,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:15:44,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:15:44,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:15:44,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:15:44,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:15:44,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:15:44,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:15:44,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:15:44,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:15:44,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:15:44,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:15:44,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:15:44,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:15:44,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:15:44,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:15:44,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:15:44,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:15:44,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:15:44,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:15:44,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:15:44,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:15:44,553 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:15:44,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:15:44,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:15:44,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:15:44,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:15:44,593 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:15:44,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:15:44,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:15:44,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:15:44,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:15:44,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:15:44,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:15:44,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:15:44,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:15:44,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:15:44,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:15:44,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:15:44,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:15:44,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:15:44,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:15:44,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:15:44,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:15:44,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:15:44,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:15:44,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:15:44,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:15:44,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:15:44,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:15:44,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:15:44,599 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_b6a6eef5-df58-4436-bab7-ebea930e8fb0/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 -> 7082604ba6f5c2a79646cd2200d1a5c8e7fdb3ae [2019-11-15 21:15:44,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:15:44,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:15:44,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:15:44,646 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:15:44,647 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:15:44,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i [2019-11-15 21:15:44,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/data/75748ddf4/1a90afd3dbcd4e9c9a6238b7b2c17e90/FLAG83ea96107 [2019-11-15 21:15:45,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:15:45,239 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i [2019-11-15 21:15:45,267 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/data/75748ddf4/1a90afd3dbcd4e9c9a6238b7b2c17e90/FLAG83ea96107 [2019-11-15 21:15:45,456 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/data/75748ddf4/1a90afd3dbcd4e9c9a6238b7b2c17e90 [2019-11-15 21:15:45,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:15:45,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:15:45,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:45,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:15:45,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:15:45,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:45" (1/1) ... [2019-11-15 21:15:45,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed1181f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:45, skipping insertion in model container [2019-11-15 21:15:45,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:45" (1/1) ... [2019-11-15 21:15:45,478 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:15:45,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:15:46,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:46,113 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:15:46,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:46,274 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:15:46,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46 WrapperNode [2019-11-15 21:15:46,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:46,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:46,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:15:46,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:15:46,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:46,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:15:46,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:15:46,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:15:46,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... [2019-11-15 21:15:46,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:15:46,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:15:46,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:15:46,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:15:46,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/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 21:15:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:15:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:15:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:15:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:15:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:15:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:15:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:15:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:15:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:15:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:15:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:15:46,521 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 21:15:47,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:15:47,441 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:15:47,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:47 BoogieIcfgContainer [2019-11-15 21:15:47,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:15:47,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:15:47,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:15:47,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:15:47,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:15:45" (1/3) ... [2019-11-15 21:15:47,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:15:47, skipping insertion in model container [2019-11-15 21:15:47,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:46" (2/3) ... [2019-11-15 21:15:47,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:15:47, skipping insertion in model container [2019-11-15 21:15:47,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:47" (3/3) ... [2019-11-15 21:15:47,451 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-11-15 21:15:47,494 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,494 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,494 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,495 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,495 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,495 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,496 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,496 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,496 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,496 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,497 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,497 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,497 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,498 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,498 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,498 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,498 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,499 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,499 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,499 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,499 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,500 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,500 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,500 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,501 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,501 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,501 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,501 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,502 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,502 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,502 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,503 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,503 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,503 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,504 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,504 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,504 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,505 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,508 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,508 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,508 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,508 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,509 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,509 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,509 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,511 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,511 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,511 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:15:47,520 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:15:47,521 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:15:47,529 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:15:47,541 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:15:47,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:15:47,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:15:47,562 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:15:47,562 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:15:47,562 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:15:47,562 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:15:47,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:15:47,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:15:47,576 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-15 21:15:49,617 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-11-15 21:15:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-11-15 21:15:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:15:49,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:49,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:49,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 733594359, now seen corresponding path program 1 times [2019-11-15 21:15:49,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:49,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886122975] [2019-11-15 21:15:49,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:49,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:49,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:50,053 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 21:15:50,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886122975] [2019-11-15 21:15:50,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:50,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:15:50,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099547368] [2019-11-15 21:15:50,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:15:50,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:15:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:15:50,083 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-11-15 21:15:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:50,819 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-11-15 21:15:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:15:50,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 21:15:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:51,103 INFO L225 Difference]: With dead ends: 23453 [2019-11-15 21:15:51,103 INFO L226 Difference]: Without dead ends: 21277 [2019-11-15 21:15:51,105 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 21:15:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-11-15 21:15:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-11-15 21:15:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-11-15 21:15:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-11-15 21:15:52,592 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-11-15 21:15:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:52,593 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-11-15 21:15:52,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:15:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-11-15 21:15:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:15:52,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:52,603 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] [2019-11-15 21:15:52,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1574494247, now seen corresponding path program 1 times [2019-11-15 21:15:52,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:52,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447017306] [2019-11-15 21:15:52,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:52,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:52,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:52,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447017306] [2019-11-15 21:15:52,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:52,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:52,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949028200] [2019-11-15 21:15:52,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:52,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:52,714 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-11-15 21:15:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:53,700 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-11-15 21:15:53,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:15:53,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-15 21:15:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:53,866 INFO L225 Difference]: With dead ends: 34711 [2019-11-15 21:15:53,867 INFO L226 Difference]: Without dead ends: 34567 [2019-11-15 21:15:53,868 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 21:15:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-11-15 21:15:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-11-15 21:15:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-11-15 21:15:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-11-15 21:15:55,337 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-11-15 21:15:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:55,338 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-11-15 21:15:55,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:15:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-11-15 21:15:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:15:55,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:55,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:55,345 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash -606075449, now seen corresponding path program 1 times [2019-11-15 21:15:55,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:55,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197730974] [2019-11-15 21:15:55,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:55,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:55,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:55,437 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 21:15:55,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197730974] [2019-11-15 21:15:55,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:55,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:55,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407359653] [2019-11-15 21:15:55,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:55,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:55,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:55,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:55,440 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-11-15 21:15:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:56,598 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-11-15 21:15:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:15:56,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 21:15:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:56,763 INFO L225 Difference]: With dead ends: 40219 [2019-11-15 21:15:56,763 INFO L226 Difference]: Without dead ends: 40059 [2019-11-15 21:15:56,764 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 21:15:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-11-15 21:15:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-11-15 21:15:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-11-15 21:15:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-11-15 21:15:58,521 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-11-15 21:15:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:58,522 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-11-15 21:15:58,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:15:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-11-15 21:15:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:15:58,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:58,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:58,538 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash 905685778, now seen corresponding path program 1 times [2019-11-15 21:15:58,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:58,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497526189] [2019-11-15 21:15:58,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,699 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 21:15:58,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497526189] [2019-11-15 21:15:58,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:58,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289938260] [2019-11-15 21:15:58,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:15:58,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:58,702 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-11-15 21:15:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:59,865 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-11-15 21:15:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:15:59,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 21:15:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:59,984 INFO L225 Difference]: With dead ends: 45668 [2019-11-15 21:15:59,984 INFO L226 Difference]: Without dead ends: 45524 [2019-11-15 21:15:59,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:16:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-11-15 21:16:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-11-15 21:16:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-11-15 21:16:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-11-15 21:16:00,861 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-11-15 21:16:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:00,861 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-11-15 21:16:00,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-11-15 21:16:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:16:00,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:00,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:00,890 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1972912513, now seen corresponding path program 1 times [2019-11-15 21:16:00,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:00,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441734696] [2019-11-15 21:16:00,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:00,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:00,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:01,012 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 21:16:01,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441734696] [2019-11-15 21:16:01,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:01,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:01,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048460877] [2019-11-15 21:16:01,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:01,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:01,015 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-11-15 21:16:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:02,443 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-11-15 21:16:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:16:02,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-15 21:16:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:02,545 INFO L225 Difference]: With dead ends: 46075 [2019-11-15 21:16:02,545 INFO L226 Difference]: Without dead ends: 45835 [2019-11-15 21:16:02,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:16:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-11-15 21:16:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-11-15 21:16:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-11-15 21:16:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-11-15 21:16:03,404 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-11-15 21:16:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:03,405 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-11-15 21:16:03,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-11-15 21:16:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:16:03,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:03,435 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] [2019-11-15 21:16:03,435 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash -207346572, now seen corresponding path program 1 times [2019-11-15 21:16:03,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:03,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523856517] [2019-11-15 21:16:03,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:03,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:03,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:03,500 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 21:16:03,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523856517] [2019-11-15 21:16:03,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:03,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:03,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153220872] [2019-11-15 21:16:03,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:03,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:03,502 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-11-15 21:16:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:04,428 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-11-15 21:16:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:04,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-15 21:16:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:04,544 INFO L225 Difference]: With dead ends: 50262 [2019-11-15 21:16:04,544 INFO L226 Difference]: Without dead ends: 50262 [2019-11-15 21:16:04,545 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 21:16:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-11-15 21:16:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-11-15 21:16:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-11-15 21:16:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-11-15 21:16:05,524 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-11-15 21:16:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:05,525 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-11-15 21:16:05,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-11-15 21:16:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:16:05,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:05,565 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 21:16:05,565 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 280232242, now seen corresponding path program 1 times [2019-11-15 21:16:05,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:05,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243241346] [2019-11-15 21:16:05,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:05,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:05,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:05,682 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 21:16:05,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243241346] [2019-11-15 21:16:05,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:05,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:16:05,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439005882] [2019-11-15 21:16:05,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:05,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:05,685 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-11-15 21:16:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:06,902 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-11-15 21:16:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:16:06,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-15 21:16:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:07,031 INFO L225 Difference]: With dead ends: 55890 [2019-11-15 21:16:07,031 INFO L226 Difference]: Without dead ends: 55650 [2019-11-15 21:16:07,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:16:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-11-15 21:16:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-11-15 21:16:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-11-15 21:16:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-11-15 21:16:08,470 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-11-15 21:16:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:08,471 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-11-15 21:16:08,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-11-15 21:16:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:16:08,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:08,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:08,513 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1547139530, now seen corresponding path program 1 times [2019-11-15 21:16:08,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:08,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548362158] [2019-11-15 21:16:08,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:08,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:08,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:08,596 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 21:16:08,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548362158] [2019-11-15 21:16:08,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:08,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:16:08,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8758025] [2019-11-15 21:16:08,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:08,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:08,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:08,599 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 5 states. [2019-11-15 21:16:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:09,970 INFO L93 Difference]: Finished difference Result 115002 states and 419394 transitions. [2019-11-15 21:16:09,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:16:09,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:16:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:10,261 INFO L225 Difference]: With dead ends: 115002 [2019-11-15 21:16:10,262 INFO L226 Difference]: Without dead ends: 114262 [2019-11-15 21:16:10,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 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 21:16:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114262 states. [2019-11-15 21:16:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114262 to 64599. [2019-11-15 21:16:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64599 states. [2019-11-15 21:16:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64599 states to 64599 states and 236588 transitions. [2019-11-15 21:16:12,753 INFO L78 Accepts]: Start accepts. Automaton has 64599 states and 236588 transitions. Word has length 65 [2019-11-15 21:16:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:12,754 INFO L462 AbstractCegarLoop]: Abstraction has 64599 states and 236588 transitions. [2019-11-15 21:16:12,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 64599 states and 236588 transitions. [2019-11-15 21:16:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:16:12,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:12,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:12,811 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1184022475, now seen corresponding path program 1 times [2019-11-15 21:16:12,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:12,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022995886] [2019-11-15 21:16:12,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:12,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:12,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:12,945 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 21:16:12,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022995886] [2019-11-15 21:16:12,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:12,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:12,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093120780] [2019-11-15 21:16:12,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:12,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:12,948 INFO L87 Difference]: Start difference. First operand 64599 states and 236588 transitions. Second operand 6 states. [2019-11-15 21:16:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:13,733 INFO L93 Difference]: Finished difference Result 71048 states and 257943 transitions. [2019-11-15 21:16:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:16:13,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 21:16:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:13,902 INFO L225 Difference]: With dead ends: 71048 [2019-11-15 21:16:13,902 INFO L226 Difference]: Without dead ends: 71048 [2019-11-15 21:16:13,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71048 states. [2019-11-15 21:16:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71048 to 65451. [2019-11-15 21:16:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65451 states. [2019-11-15 21:16:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65451 states to 65451 states and 239375 transitions. [2019-11-15 21:16:15,333 INFO L78 Accepts]: Start accepts. Automaton has 65451 states and 239375 transitions. Word has length 65 [2019-11-15 21:16:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:15,333 INFO L462 AbstractCegarLoop]: Abstraction has 65451 states and 239375 transitions. [2019-11-15 21:16:15,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 65451 states and 239375 transitions. [2019-11-15 21:16:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:16:15,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:15,412 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:15,412 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1183167156, now seen corresponding path program 1 times [2019-11-15 21:16:15,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:15,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855439759] [2019-11-15 21:16:15,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:15,535 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 21:16:15,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855439759] [2019-11-15 21:16:15,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:15,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:16:15,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045892009] [2019-11-15 21:16:15,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:15,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:15,541 INFO L87 Difference]: Start difference. First operand 65451 states and 239375 transitions. Second operand 7 states. [2019-11-15 21:16:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:17,552 INFO L93 Difference]: Finished difference Result 75675 states and 272886 transitions. [2019-11-15 21:16:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:16:17,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 21:16:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:17,728 INFO L225 Difference]: With dead ends: 75675 [2019-11-15 21:16:17,729 INFO L226 Difference]: Without dead ends: 75475 [2019-11-15 21:16:17,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:16:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75475 states. [2019-11-15 21:16:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75475 to 66329. [2019-11-15 21:16:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66329 states. [2019-11-15 21:16:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66329 states to 66329 states and 242246 transitions. [2019-11-15 21:16:19,161 INFO L78 Accepts]: Start accepts. Automaton has 66329 states and 242246 transitions. Word has length 65 [2019-11-15 21:16:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:19,161 INFO L462 AbstractCegarLoop]: Abstraction has 66329 states and 242246 transitions. [2019-11-15 21:16:19,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66329 states and 242246 transitions. [2019-11-15 21:16:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 21:16:19,224 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:19,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:19,225 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash -712788728, now seen corresponding path program 1 times [2019-11-15 21:16:19,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:19,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914218967] [2019-11-15 21:16:19,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:19,303 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 21:16:19,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914218967] [2019-11-15 21:16:19,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:19,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:19,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778278367] [2019-11-15 21:16:19,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:19,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:19,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:19,304 INFO L87 Difference]: Start difference. First operand 66329 states and 242246 transitions. Second operand 3 states. [2019-11-15 21:16:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:19,739 INFO L93 Difference]: Finished difference Result 64370 states and 233071 transitions. [2019-11-15 21:16:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:19,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 21:16:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:19,882 INFO L225 Difference]: With dead ends: 64370 [2019-11-15 21:16:19,882 INFO L226 Difference]: Without dead ends: 64208 [2019-11-15 21:16:19,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64208 states. [2019-11-15 21:16:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64208 to 64180. [2019-11-15 21:16:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64180 states. [2019-11-15 21:16:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64180 states to 64180 states and 232443 transitions. [2019-11-15 21:16:21,778 INFO L78 Accepts]: Start accepts. Automaton has 64180 states and 232443 transitions. Word has length 67 [2019-11-15 21:16:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:21,778 INFO L462 AbstractCegarLoop]: Abstraction has 64180 states and 232443 transitions. [2019-11-15 21:16:21,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 64180 states and 232443 transitions. [2019-11-15 21:16:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:16:21,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:21,834 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 21:16:21,834 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1470674241, now seen corresponding path program 1 times [2019-11-15 21:16:21,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:21,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478999941] [2019-11-15 21:16:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,921 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 21:16:21,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478999941] [2019-11-15 21:16:21,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:21,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:16:21,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447141721] [2019-11-15 21:16:21,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:21,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:21,923 INFO L87 Difference]: Start difference. First operand 64180 states and 232443 transitions. Second operand 4 states. [2019-11-15 21:16:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:22,016 INFO L93 Difference]: Finished difference Result 16840 states and 53043 transitions. [2019-11-15 21:16:22,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:16:22,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 21:16:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:22,043 INFO L225 Difference]: With dead ends: 16840 [2019-11-15 21:16:22,043 INFO L226 Difference]: Without dead ends: 16137 [2019-11-15 21:16:22,043 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 21:16:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-11-15 21:16:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16001. [2019-11-15 21:16:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16001 states. [2019-11-15 21:16:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16001 states to 16001 states and 50461 transitions. [2019-11-15 21:16:22,287 INFO L78 Accepts]: Start accepts. Automaton has 16001 states and 50461 transitions. Word has length 68 [2019-11-15 21:16:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:22,287 INFO L462 AbstractCegarLoop]: Abstraction has 16001 states and 50461 transitions. [2019-11-15 21:16:22,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 16001 states and 50461 transitions. [2019-11-15 21:16:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 21:16:22,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:22,300 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] [2019-11-15 21:16:22,300 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1982614502, now seen corresponding path program 1 times [2019-11-15 21:16:22,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:22,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308781568] [2019-11-15 21:16:22,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:22,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:22,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:22,449 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 21:16:22,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308781568] [2019-11-15 21:16:22,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:22,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:16:22,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790943857] [2019-11-15 21:16:22,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:16:22,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:16:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:22,452 INFO L87 Difference]: Start difference. First operand 16001 states and 50461 transitions. Second operand 8 states. [2019-11-15 21:16:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:23,273 INFO L93 Difference]: Finished difference Result 17894 states and 55974 transitions. [2019-11-15 21:16:23,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:16:23,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-11-15 21:16:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:23,296 INFO L225 Difference]: With dead ends: 17894 [2019-11-15 21:16:23,296 INFO L226 Difference]: Without dead ends: 17846 [2019-11-15 21:16:23,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:16:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17846 states. [2019-11-15 21:16:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17846 to 16094. [2019-11-15 21:16:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16094 states. [2019-11-15 21:16:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 50886 transitions. [2019-11-15 21:16:23,508 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 50886 transitions. Word has length 77 [2019-11-15 21:16:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:23,509 INFO L462 AbstractCegarLoop]: Abstraction has 16094 states and 50886 transitions. [2019-11-15 21:16:23,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:16:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 50886 transitions. [2019-11-15 21:16:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:16:23,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:23,521 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] [2019-11-15 21:16:23,521 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:23,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1564951717, now seen corresponding path program 1 times [2019-11-15 21:16:23,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:23,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663664627] [2019-11-15 21:16:23,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:23,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:23,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:23,622 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 21:16:23,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663664627] [2019-11-15 21:16:23,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:23,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:23,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931668101] [2019-11-15 21:16:23,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:23,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:23,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:23,624 INFO L87 Difference]: Start difference. First operand 16094 states and 50886 transitions. Second operand 6 states. [2019-11-15 21:16:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:24,039 INFO L93 Difference]: Finished difference Result 17857 states and 55827 transitions. [2019-11-15 21:16:24,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:16:24,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-15 21:16:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:24,061 INFO L225 Difference]: With dead ends: 17857 [2019-11-15 21:16:24,061 INFO L226 Difference]: Without dead ends: 17857 [2019-11-15 21:16:24,062 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 21:16:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-11-15 21:16:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 17110. [2019-11-15 21:16:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2019-11-15 21:16:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 53670 transitions. [2019-11-15 21:16:24,291 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 53670 transitions. Word has length 80 [2019-11-15 21:16:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:24,292 INFO L462 AbstractCegarLoop]: Abstraction has 17110 states and 53670 transitions. [2019-11-15 21:16:24,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 53670 transitions. [2019-11-15 21:16:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:16:24,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:24,306 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] [2019-11-15 21:16:24,306 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash 794355292, now seen corresponding path program 1 times [2019-11-15 21:16:24,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:24,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228508039] [2019-11-15 21:16:24,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:24,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:24,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:24,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228508039] [2019-11-15 21:16:24,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:24,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:16:24,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474867252] [2019-11-15 21:16:24,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:24,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:24,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:24,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:24,410 INFO L87 Difference]: Start difference. First operand 17110 states and 53670 transitions. Second operand 7 states. [2019-11-15 21:16:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:24,876 INFO L93 Difference]: Finished difference Result 18508 states and 57510 transitions. [2019-11-15 21:16:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:16:24,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-11-15 21:16:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:24,899 INFO L225 Difference]: With dead ends: 18508 [2019-11-15 21:16:24,899 INFO L226 Difference]: Without dead ends: 18508 [2019-11-15 21:16:24,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:16:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18508 states. [2019-11-15 21:16:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18508 to 17958. [2019-11-15 21:16:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17958 states. [2019-11-15 21:16:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17958 states to 17958 states and 55879 transitions. [2019-11-15 21:16:25,126 INFO L78 Accepts]: Start accepts. Automaton has 17958 states and 55879 transitions. Word has length 80 [2019-11-15 21:16:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:25,126 INFO L462 AbstractCegarLoop]: Abstraction has 17958 states and 55879 transitions. [2019-11-15 21:16:25,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 17958 states and 55879 transitions. [2019-11-15 21:16:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:16:25,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:25,140 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] [2019-11-15 21:16:25,140 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:25,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1124121053, now seen corresponding path program 1 times [2019-11-15 21:16:25,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:25,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710416671] [2019-11-15 21:16:25,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:25,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:25,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:25,212 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 21:16:25,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710416671] [2019-11-15 21:16:25,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:25,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:25,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710607799] [2019-11-15 21:16:25,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:25,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:25,222 INFO L87 Difference]: Start difference. First operand 17958 states and 55879 transitions. Second operand 3 states. [2019-11-15 21:16:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:25,307 INFO L93 Difference]: Finished difference Result 16132 states and 49733 transitions. [2019-11-15 21:16:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:25,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-15 21:16:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:25,335 INFO L225 Difference]: With dead ends: 16132 [2019-11-15 21:16:25,335 INFO L226 Difference]: Without dead ends: 16132 [2019-11-15 21:16:25,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 21:16:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16132 states. [2019-11-15 21:16:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16132 to 15826. [2019-11-15 21:16:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15826 states. [2019-11-15 21:16:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15826 states to 15826 states and 48840 transitions. [2019-11-15 21:16:25,587 INFO L78 Accepts]: Start accepts. Automaton has 15826 states and 48840 transitions. Word has length 80 [2019-11-15 21:16:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:25,587 INFO L462 AbstractCegarLoop]: Abstraction has 15826 states and 48840 transitions. [2019-11-15 21:16:25,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 15826 states and 48840 transitions. [2019-11-15 21:16:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:25,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:25,598 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] [2019-11-15 21:16:25,598 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1841103327, now seen corresponding path program 1 times [2019-11-15 21:16:25,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:25,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357306269] [2019-11-15 21:16:25,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:25,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:25,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:25,662 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 21:16:25,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357306269] [2019-11-15 21:16:25,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:25,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:16:25,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180237874] [2019-11-15 21:16:25,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:25,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:25,664 INFO L87 Difference]: Start difference. First operand 15826 states and 48840 transitions. Second operand 5 states. [2019-11-15 21:16:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:26,375 INFO L93 Difference]: Finished difference Result 35182 states and 108171 transitions. [2019-11-15 21:16:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:16:26,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-15 21:16:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:26,444 INFO L225 Difference]: With dead ends: 35182 [2019-11-15 21:16:26,445 INFO L226 Difference]: Without dead ends: 35182 [2019-11-15 21:16:26,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-11-15 21:16:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 23176. [2019-11-15 21:16:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23176 states. [2019-11-15 21:16:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23176 states to 23176 states and 72489 transitions. [2019-11-15 21:16:26,949 INFO L78 Accepts]: Start accepts. Automaton has 23176 states and 72489 transitions. Word has length 81 [2019-11-15 21:16:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:26,949 INFO L462 AbstractCegarLoop]: Abstraction has 23176 states and 72489 transitions. [2019-11-15 21:16:26,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23176 states and 72489 transitions. [2019-11-15 21:16:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:26,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:26,967 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] [2019-11-15 21:16:26,968 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1492249952, now seen corresponding path program 1 times [2019-11-15 21:16:26,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:26,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049503505] [2019-11-15 21:16:26,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:26,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:26,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:27,031 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 21:16:27,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049503505] [2019-11-15 21:16:27,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:27,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:16:27,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103672505] [2019-11-15 21:16:27,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:27,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:27,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:27,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:27,033 INFO L87 Difference]: Start difference. First operand 23176 states and 72489 transitions. Second operand 4 states. [2019-11-15 21:16:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:27,336 INFO L93 Difference]: Finished difference Result 28638 states and 88233 transitions. [2019-11-15 21:16:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:27,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 21:16:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:27,375 INFO L225 Difference]: With dead ends: 28638 [2019-11-15 21:16:27,375 INFO L226 Difference]: Without dead ends: 28584 [2019-11-15 21:16:27,375 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 21:16:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-11-15 21:16:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 26034. [2019-11-15 21:16:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26034 states. [2019-11-15 21:16:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26034 states to 26034 states and 80905 transitions. [2019-11-15 21:16:28,071 INFO L78 Accepts]: Start accepts. Automaton has 26034 states and 80905 transitions. Word has length 81 [2019-11-15 21:16:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:28,071 INFO L462 AbstractCegarLoop]: Abstraction has 26034 states and 80905 transitions. [2019-11-15 21:16:28,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 26034 states and 80905 transitions. [2019-11-15 21:16:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:28,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:28,088 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] [2019-11-15 21:16:28,088 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1880033761, now seen corresponding path program 1 times [2019-11-15 21:16:28,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:28,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000216352] [2019-11-15 21:16:28,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:28,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:28,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:28,200 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 21:16:28,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000216352] [2019-11-15 21:16:28,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:28,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:16:28,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011872844] [2019-11-15 21:16:28,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:16:28,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:28,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:16:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:28,203 INFO L87 Difference]: Start difference. First operand 26034 states and 80905 transitions. Second operand 8 states. [2019-11-15 21:16:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:30,221 INFO L93 Difference]: Finished difference Result 59615 states and 177262 transitions. [2019-11-15 21:16:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 21:16:30,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-11-15 21:16:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:30,333 INFO L225 Difference]: With dead ends: 59615 [2019-11-15 21:16:30,333 INFO L226 Difference]: Without dead ends: 59168 [2019-11-15 21:16:30,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:16:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59168 states. [2019-11-15 21:16:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59168 to 29760. [2019-11-15 21:16:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29760 states. [2019-11-15 21:16:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29760 states to 29760 states and 91313 transitions. [2019-11-15 21:16:30,939 INFO L78 Accepts]: Start accepts. Automaton has 29760 states and 91313 transitions. Word has length 81 [2019-11-15 21:16:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:30,939 INFO L462 AbstractCegarLoop]: Abstraction has 29760 states and 91313 transitions. [2019-11-15 21:16:30,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:16:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 29760 states and 91313 transitions. [2019-11-15 21:16:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:30,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:30,963 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] [2019-11-15 21:16:30,963 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1170169054, now seen corresponding path program 1 times [2019-11-15 21:16:30,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:30,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345232902] [2019-11-15 21:16:30,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:30,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:30,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:31,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345232902] [2019-11-15 21:16:31,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:31,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:31,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485326186] [2019-11-15 21:16:31,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:31,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:31,053 INFO L87 Difference]: Start difference. First operand 29760 states and 91313 transitions. Second operand 6 states. [2019-11-15 21:16:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:31,608 INFO L93 Difference]: Finished difference Result 31538 states and 96115 transitions. [2019-11-15 21:16:31,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:16:31,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-15 21:16:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:31,666 INFO L225 Difference]: With dead ends: 31538 [2019-11-15 21:16:31,667 INFO L226 Difference]: Without dead ends: 31513 [2019-11-15 21:16:31,667 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 21:16:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31513 states. [2019-11-15 21:16:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31513 to 30369. [2019-11-15 21:16:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30369 states. [2019-11-15 21:16:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30369 states to 30369 states and 92831 transitions. [2019-11-15 21:16:32,086 INFO L78 Accepts]: Start accepts. Automaton has 30369 states and 92831 transitions. Word has length 81 [2019-11-15 21:16:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:32,086 INFO L462 AbstractCegarLoop]: Abstraction has 30369 states and 92831 transitions. [2019-11-15 21:16:32,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30369 states and 92831 transitions. [2019-11-15 21:16:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:32,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:32,107 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] [2019-11-15 21:16:32,108 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1189137955, now seen corresponding path program 1 times [2019-11-15 21:16:32,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:32,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881185483] [2019-11-15 21:16:32,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:32,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:32,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:32,205 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 21:16:32,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881185483] [2019-11-15 21:16:32,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:32,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:32,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40653382] [2019-11-15 21:16:32,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:32,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:32,207 INFO L87 Difference]: Start difference. First operand 30369 states and 92831 transitions. Second operand 6 states. [2019-11-15 21:16:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:32,544 INFO L93 Difference]: Finished difference Result 33304 states and 99448 transitions. [2019-11-15 21:16:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:16:32,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-15 21:16:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:32,588 INFO L225 Difference]: With dead ends: 33304 [2019-11-15 21:16:32,588 INFO L226 Difference]: Without dead ends: 33304 [2019-11-15 21:16:32,588 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 21:16:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33304 states. [2019-11-15 21:16:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33304 to 30103. [2019-11-15 21:16:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30103 states. [2019-11-15 21:16:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30103 states to 30103 states and 90448 transitions. [2019-11-15 21:16:33,005 INFO L78 Accepts]: Start accepts. Automaton has 30103 states and 90448 transitions. Word has length 81 [2019-11-15 21:16:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:33,005 INFO L462 AbstractCegarLoop]: Abstraction has 30103 states and 90448 transitions. [2019-11-15 21:16:33,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 30103 states and 90448 transitions. [2019-11-15 21:16:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:33,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:33,026 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] [2019-11-15 21:16:33,027 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:33,027 INFO L82 PathProgramCache]: Analyzing trace with hash 274139235, now seen corresponding path program 1 times [2019-11-15 21:16:33,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:33,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451663667] [2019-11-15 21:16:33,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:33,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:33,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:33,097 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 21:16:33,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451663667] [2019-11-15 21:16:33,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:33,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:16:33,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079808332] [2019-11-15 21:16:33,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:33,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:33,099 INFO L87 Difference]: Start difference. First operand 30103 states and 90448 transitions. Second operand 5 states. [2019-11-15 21:16:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:33,391 INFO L93 Difference]: Finished difference Result 31312 states and 92985 transitions. [2019-11-15 21:16:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:16:33,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-15 21:16:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:33,433 INFO L225 Difference]: With dead ends: 31312 [2019-11-15 21:16:33,433 INFO L226 Difference]: Without dead ends: 31132 [2019-11-15 21:16:33,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31132 states. [2019-11-15 21:16:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31132 to 25783. [2019-11-15 21:16:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25783 states. [2019-11-15 21:16:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25783 states to 25783 states and 77713 transitions. [2019-11-15 21:16:33,812 INFO L78 Accepts]: Start accepts. Automaton has 25783 states and 77713 transitions. Word has length 81 [2019-11-15 21:16:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:33,813 INFO L462 AbstractCegarLoop]: Abstraction has 25783 states and 77713 transitions. [2019-11-15 21:16:33,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25783 states and 77713 transitions. [2019-11-15 21:16:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:16:33,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:33,831 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] [2019-11-15 21:16:33,832 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1518903716, now seen corresponding path program 1 times [2019-11-15 21:16:33,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:33,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905834070] [2019-11-15 21:16:33,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:33,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:33,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:33,905 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 21:16:33,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905834070] [2019-11-15 21:16:33,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:33,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:16:33,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696422803] [2019-11-15 21:16:33,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:33,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:33,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:33,907 INFO L87 Difference]: Start difference. First operand 25783 states and 77713 transitions. Second operand 5 states. [2019-11-15 21:16:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:33,953 INFO L93 Difference]: Finished difference Result 2812 states and 6806 transitions. [2019-11-15 21:16:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:33,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-15 21:16:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:33,956 INFO L225 Difference]: With dead ends: 2812 [2019-11-15 21:16:33,956 INFO L226 Difference]: Without dead ends: 2500 [2019-11-15 21:16:33,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-11-15 21:16:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2393. [2019-11-15 21:16:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-15 21:16:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 5809 transitions. [2019-11-15 21:16:33,982 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 5809 transitions. Word has length 81 [2019-11-15 21:16:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:33,982 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 5809 transitions. [2019-11-15 21:16:33,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 5809 transitions. [2019-11-15 21:16:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:33,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:33,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:33,984 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1894335506, now seen corresponding path program 1 times [2019-11-15 21:16:33,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:33,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436020851] [2019-11-15 21:16:33,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:33,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:33,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:34,041 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 21:16:34,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436020851] [2019-11-15 21:16:34,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:34,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:16:34,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658710993] [2019-11-15 21:16:34,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:34,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:34,044 INFO L87 Difference]: Start difference. First operand 2393 states and 5809 transitions. Second operand 5 states. [2019-11-15 21:16:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:34,235 INFO L93 Difference]: Finished difference Result 2777 states and 6609 transitions. [2019-11-15 21:16:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:16:34,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 21:16:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:34,238 INFO L225 Difference]: With dead ends: 2777 [2019-11-15 21:16:34,238 INFO L226 Difference]: Without dead ends: 2759 [2019-11-15 21:16:34,238 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 21:16:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-11-15 21:16:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2462. [2019-11-15 21:16:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2019-11-15 21:16:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 5944 transitions. [2019-11-15 21:16:34,261 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 5944 transitions. Word has length 94 [2019-11-15 21:16:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:34,261 INFO L462 AbstractCegarLoop]: Abstraction has 2462 states and 5944 transitions. [2019-11-15 21:16:34,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 5944 transitions. [2019-11-15 21:16:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:34,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:34,263 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:34,263 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1301417684, now seen corresponding path program 1 times [2019-11-15 21:16:34,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:34,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073646607] [2019-11-15 21:16:34,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:34,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:34,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:34,450 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 21:16:34,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073646607] [2019-11-15 21:16:34,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:34,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:16:34,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341011677] [2019-11-15 21:16:34,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:16:34,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:16:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:16:34,452 INFO L87 Difference]: Start difference. First operand 2462 states and 5944 transitions. Second operand 10 states. [2019-11-15 21:16:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:34,919 INFO L93 Difference]: Finished difference Result 2756 states and 6529 transitions. [2019-11-15 21:16:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:16:34,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-15 21:16:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:34,922 INFO L225 Difference]: With dead ends: 2756 [2019-11-15 21:16:34,922 INFO L226 Difference]: Without dead ends: 2716 [2019-11-15 21:16:34,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:16:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-11-15 21:16:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2541. [2019-11-15 21:16:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-11-15 21:16:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 6120 transitions. [2019-11-15 21:16:34,945 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 6120 transitions. Word has length 94 [2019-11-15 21:16:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:34,945 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 6120 transitions. [2019-11-15 21:16:34,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:16:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 6120 transitions. [2019-11-15 21:16:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:34,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:34,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:34,947 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -634242603, now seen corresponding path program 1 times [2019-11-15 21:16:34,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:34,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879306869] [2019-11-15 21:16:34,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:34,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:34,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:35,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879306869] [2019-11-15 21:16:35,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:35,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:35,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732468666] [2019-11-15 21:16:35,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:35,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:35,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:35,047 INFO L87 Difference]: Start difference. First operand 2541 states and 6120 transitions. Second operand 6 states. [2019-11-15 21:16:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:35,218 INFO L93 Difference]: Finished difference Result 4354 states and 10531 transitions. [2019-11-15 21:16:35,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:35,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 21:16:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:35,221 INFO L225 Difference]: With dead ends: 4354 [2019-11-15 21:16:35,222 INFO L226 Difference]: Without dead ends: 4354 [2019-11-15 21:16:35,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2019-11-15 21:16:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 2579. [2019-11-15 21:16:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2019-11-15 21:16:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 6177 transitions. [2019-11-15 21:16:35,253 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 6177 transitions. Word has length 94 [2019-11-15 21:16:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:35,253 INFO L462 AbstractCegarLoop]: Abstraction has 2579 states and 6177 transitions. [2019-11-15 21:16:35,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 6177 transitions. [2019-11-15 21:16:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:35,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:35,255 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:35,255 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:35,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1959984214, now seen corresponding path program 1 times [2019-11-15 21:16:35,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:35,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432616854] [2019-11-15 21:16:35,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:35,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:35,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:35,348 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 21:16:35,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432616854] [2019-11-15 21:16:35,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:35,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:35,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975542836] [2019-11-15 21:16:35,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:35,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:35,350 INFO L87 Difference]: Start difference. First operand 2579 states and 6177 transitions. Second operand 6 states. [2019-11-15 21:16:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:35,538 INFO L93 Difference]: Finished difference Result 2755 states and 6550 transitions. [2019-11-15 21:16:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:35,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 21:16:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:35,541 INFO L225 Difference]: With dead ends: 2755 [2019-11-15 21:16:35,541 INFO L226 Difference]: Without dead ends: 2755 [2019-11-15 21:16:35,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-15 21:16:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2523. [2019-11-15 21:16:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-11-15 21:16:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 6056 transitions. [2019-11-15 21:16:35,565 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 6056 transitions. Word has length 94 [2019-11-15 21:16:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:35,565 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 6056 transitions. [2019-11-15 21:16:35,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 6056 transitions. [2019-11-15 21:16:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:35,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:35,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:35,567 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1860359019, now seen corresponding path program 1 times [2019-11-15 21:16:35,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:35,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641687745] [2019-11-15 21:16:35,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:35,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:35,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:35,680 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 21:16:35,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641687745] [2019-11-15 21:16:35,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:35,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:16:35,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251627821] [2019-11-15 21:16:35,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:35,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:35,682 INFO L87 Difference]: Start difference. First operand 2523 states and 6056 transitions. Second operand 7 states. [2019-11-15 21:16:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:35,982 INFO L93 Difference]: Finished difference Result 3130 states and 7378 transitions. [2019-11-15 21:16:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:16:35,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 21:16:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:35,984 INFO L225 Difference]: With dead ends: 3130 [2019-11-15 21:16:35,985 INFO L226 Difference]: Without dead ends: 3130 [2019-11-15 21:16:35,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2019-11-15 21:16:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2595. [2019-11-15 21:16:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2019-11-15 21:16:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 6206 transitions. [2019-11-15 21:16:36,009 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 6206 transitions. Word has length 94 [2019-11-15 21:16:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:36,009 INFO L462 AbstractCegarLoop]: Abstraction has 2595 states and 6206 transitions. [2019-11-15 21:16:36,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 6206 transitions. [2019-11-15 21:16:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:36,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:36,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:36,011 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash 733867798, now seen corresponding path program 1 times [2019-11-15 21:16:36,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:36,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551782809] [2019-11-15 21:16:36,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:36,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:36,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:36,137 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 21:16:36,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551782809] [2019-11-15 21:16:36,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:36,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:16:36,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237400922] [2019-11-15 21:16:36,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:36,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:36,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:36,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:36,139 INFO L87 Difference]: Start difference. First operand 2595 states and 6206 transitions. Second operand 7 states. [2019-11-15 21:16:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:36,406 INFO L93 Difference]: Finished difference Result 2749 states and 6468 transitions. [2019-11-15 21:16:36,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:16:36,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 21:16:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:36,409 INFO L225 Difference]: With dead ends: 2749 [2019-11-15 21:16:36,409 INFO L226 Difference]: Without dead ends: 2689 [2019-11-15 21:16:36,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:16:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2019-11-15 21:16:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2447. [2019-11-15 21:16:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-15 21:16:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 5885 transitions. [2019-11-15 21:16:36,432 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 5885 transitions. Word has length 94 [2019-11-15 21:16:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:36,432 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 5885 transitions. [2019-11-15 21:16:36,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 5885 transitions. [2019-11-15 21:16:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:36,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:36,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:36,434 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1201792489, now seen corresponding path program 1 times [2019-11-15 21:16:36,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:36,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023848163] [2019-11-15 21:16:36,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:36,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:36,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:36,561 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 21:16:36,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023848163] [2019-11-15 21:16:36,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:36,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:16:36,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690629155] [2019-11-15 21:16:36,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:16:36,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:16:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:36,563 INFO L87 Difference]: Start difference. First operand 2447 states and 5885 transitions. Second operand 8 states. [2019-11-15 21:16:36,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:36,660 INFO L93 Difference]: Finished difference Result 4160 states and 10109 transitions. [2019-11-15 21:16:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:16:36,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-15 21:16:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:36,662 INFO L225 Difference]: With dead ends: 4160 [2019-11-15 21:16:36,662 INFO L226 Difference]: Without dead ends: 1900 [2019-11-15 21:16:36,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:16:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-11-15 21:16:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1820. [2019-11-15 21:16:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-11-15 21:16:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4418 transitions. [2019-11-15 21:16:36,678 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4418 transitions. Word has length 94 [2019-11-15 21:16:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:36,679 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4418 transitions. [2019-11-15 21:16:36,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:16:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4418 transitions. [2019-11-15 21:16:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:36,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:36,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:36,680 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1800488869, now seen corresponding path program 2 times [2019-11-15 21:16:36,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:36,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098860821] [2019-11-15 21:16:36,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:36,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:36,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:36,823 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 21:16:36,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098860821] [2019-11-15 21:16:36,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:36,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 21:16:36,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949167355] [2019-11-15 21:16:36,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:16:36,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:16:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:16:36,825 INFO L87 Difference]: Start difference. First operand 1820 states and 4418 transitions. Second operand 11 states. [2019-11-15 21:16:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:37,050 INFO L93 Difference]: Finished difference Result 3275 states and 8049 transitions. [2019-11-15 21:16:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:16:37,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-11-15 21:16:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:37,052 INFO L225 Difference]: With dead ends: 3275 [2019-11-15 21:16:37,053 INFO L226 Difference]: Without dead ends: 2375 [2019-11-15 21:16:37,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:16:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2019-11-15 21:16:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2263. [2019-11-15 21:16:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-11-15 21:16:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 5402 transitions. [2019-11-15 21:16:37,075 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 5402 transitions. Word has length 94 [2019-11-15 21:16:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:37,076 INFO L462 AbstractCegarLoop]: Abstraction has 2263 states and 5402 transitions. [2019-11-15 21:16:37,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:16:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 5402 transitions. [2019-11-15 21:16:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:16:37,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:37,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:37,078 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash -102230519, now seen corresponding path program 3 times [2019-11-15 21:16:37,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:37,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868085107] [2019-11-15 21:16:37,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:37,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:37,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:37,166 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:37,166 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:16:37,301 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:16:37,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:16:37 BasicIcfg [2019-11-15 21:16:37,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:16:37,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:16:37,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:16:37,310 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:16:37,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:47" (3/4) ... [2019-11-15 21:16:37,318 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:16:37,467 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b6a6eef5-df58-4436-bab7-ebea930e8fb0/bin/uautomizer/witness.graphml [2019-11-15 21:16:37,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:16:37,469 INFO L168 Benchmark]: Toolchain (without parser) took 52009.17 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 939.4 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 864.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:37,470 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:37,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:37,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:37,471 INFO L168 Benchmark]: Boogie Preprocessor took 68.54 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 21:16:37,471 INFO L168 Benchmark]: RCFGBuilder took 1018.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:37,472 INFO L168 Benchmark]: TraceAbstraction took 49865.95 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 820.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:37,472 INFO L168 Benchmark]: Witness Printer took 157.77 ms. Allocated memory is still 4.7 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:37,475 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 815.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.54 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 1018.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49865.95 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 820.5 MB. Max. memory is 11.5 GB. * Witness Printer took 157.77 ms. Allocated memory is still 4.7 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 175 locations, 3 error locations. Result: UNSAFE, OverallTime: 49.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8324 SDtfs, 9874 SDslu, 20669 SDs, 0 SdLazy, 9468 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 100 SyntacticMatches, 12 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66329occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 166747 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2412 NumberOfCodeBlocks, 2412 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2287 ConstructedInterpolants, 0 QuantifiedInterpolants, 454437 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...