./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/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 72eebd6ab8579a8e385d634d21f6ef09c2f9f744 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:30:50,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:30:50,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:30:50,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:30:50,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:30:50,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:30:50,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:30:50,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:30:50,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:30:50,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:30:50,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:30:50,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:30:50,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:30:50,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:30:50,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:30:50,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:30:50,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:30:50,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:30:50,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:30:50,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:30:50,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:30:50,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:30:50,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:30:50,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:30:50,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:30:50,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:30:50,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:30:50,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:30:50,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:30:50,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:30:50,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:30:50,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:30:50,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:30:50,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:30:50,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:30:50,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:30:50,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:30:50,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:30:50,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:30:50,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:30:50,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:30:50,637 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:30:50,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:30:50,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:30:50,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:30:50,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:30:50,663 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:30:50,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:30:50,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:30:50,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:30:50,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:30:50,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:30:50,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:30:50,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:30:50,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:30:50,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:30:50,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:30:50,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:30:50,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:30:50,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:30:50,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:30:50,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:30:50,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:30:50,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:50,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:30:50,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:30:50,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:30:50,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:30:50,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:30:50,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:30:50,668 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_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/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 -> 72eebd6ab8579a8e385d634d21f6ef09c2f9f744 [2019-11-16 00:30:50,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:30:50,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:30:50,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:30:50,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:30:50,724 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:30:50,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt.i [2019-11-16 00:30:50,779 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/data/606da5c04/c6a0741b68364a438df0614235a6685f/FLAG01daf8bb2 [2019-11-16 00:30:51,266 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:30:51,267 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/sv-benchmarks/c/pthread-wmm/mix041_tso.opt.i [2019-11-16 00:30:51,292 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/data/606da5c04/c6a0741b68364a438df0614235a6685f/FLAG01daf8bb2 [2019-11-16 00:30:51,560 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/data/606da5c04/c6a0741b68364a438df0614235a6685f [2019-11-16 00:30:51,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:30:51,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:30:51,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:51,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:30:51,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:30:51,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:51" (1/1) ... [2019-11-16 00:30:51,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46020af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:51, skipping insertion in model container [2019-11-16 00:30:51,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:51" (1/1) ... [2019-11-16 00:30:51,579 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:30:51,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:30:52,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:52,169 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:30:52,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:52,322 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:30:52,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52 WrapperNode [2019-11-16 00:30:52,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:52,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:30:52,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:30:52,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:30:52,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:30:52,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:30:52,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:30:52,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:30:52,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... [2019-11-16 00:30:52,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:30:52,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:30:52,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:30:52,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:30:52,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:30:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:30:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:30:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:30:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:30:52,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:30:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:30:52,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:30:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:30:52,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:30:52,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:30:52,499 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:30:53,223 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:30:53,224 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:30:53,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:53 BoogieIcfgContainer [2019-11-16 00:30:53,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:30:53,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:30:53,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:30:53,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:30:53,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:51" (1/3) ... [2019-11-16 00:30:53,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea11368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:53, skipping insertion in model container [2019-11-16 00:30:53,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:52" (2/3) ... [2019-11-16 00:30:53,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea11368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:53, skipping insertion in model container [2019-11-16 00:30:53,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:53" (3/3) ... [2019-11-16 00:30:53,232 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2019-11-16 00:30:53,264 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,264 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,265 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,265 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,265 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,265 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,265 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,266 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,266 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,266 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,266 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,266 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,267 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,267 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,267 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,267 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,267 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,268 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,269 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,271 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,271 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,271 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,271 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,271 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,272 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:53,282 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:30:53,282 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:30:53,289 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:30:53,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:30:53,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:30:53,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:30:53,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:30:53,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:30:53,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:30:53,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:30:53,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:30:53,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:30:53,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-16 00:30:54,909 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22495 states. [2019-11-16 00:30:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 22495 states. [2019-11-16 00:30:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:30:54,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:54,923 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] [2019-11-16 00:30:54,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash -406661720, now seen corresponding path program 1 times [2019-11-16 00:30:54,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:54,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378715985] [2019-11-16 00:30:54,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:54,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:54,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:55,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378715985] [2019-11-16 00:30:55,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:55,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:55,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780649327] [2019-11-16 00:30:55,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:55,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:55,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:55,284 INFO L87 Difference]: Start difference. First operand 22495 states. Second operand 4 states. [2019-11-16 00:30:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:56,001 INFO L93 Difference]: Finished difference Result 23447 states and 91748 transitions. [2019-11-16 00:30:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:56,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-16 00:30:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:56,226 INFO L225 Difference]: With dead ends: 23447 [2019-11-16 00:30:56,230 INFO L226 Difference]: Without dead ends: 21271 [2019-11-16 00:30:56,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21271 states. [2019-11-16 00:30:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21271 to 21271. [2019-11-16 00:30:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21271 states. [2019-11-16 00:30:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 83772 transitions. [2019-11-16 00:30:57,473 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 83772 transitions. Word has length 38 [2019-11-16 00:30:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:57,475 INFO L462 AbstractCegarLoop]: Abstraction has 21271 states and 83772 transitions. [2019-11-16 00:30:57,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 83772 transitions. [2019-11-16 00:30:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:30:57,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:57,485 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:57,486 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1298258461, now seen corresponding path program 1 times [2019-11-16 00:30:57,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:57,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94974307] [2019-11-16 00:30:57,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:57,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:57,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:57,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94974307] [2019-11-16 00:30:57,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:57,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:57,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282822339] [2019-11-16 00:30:57,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:57,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:57,628 INFO L87 Difference]: Start difference. First operand 21271 states and 83772 transitions. Second operand 5 states. [2019-11-16 00:30:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:58,618 INFO L93 Difference]: Finished difference Result 34705 states and 129064 transitions. [2019-11-16 00:30:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:58,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:30:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:58,759 INFO L225 Difference]: With dead ends: 34705 [2019-11-16 00:30:58,759 INFO L226 Difference]: Without dead ends: 34561 [2019-11-16 00:30:58,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34561 states. [2019-11-16 00:30:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34561 to 33061. [2019-11-16 00:30:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33061 states. [2019-11-16 00:30:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33061 states to 33061 states and 123952 transitions. [2019-11-16 00:30:59,926 INFO L78 Accepts]: Start accepts. Automaton has 33061 states and 123952 transitions. Word has length 45 [2019-11-16 00:30:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:59,928 INFO L462 AbstractCegarLoop]: Abstraction has 33061 states and 123952 transitions. [2019-11-16 00:30:59,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 33061 states and 123952 transitions. [2019-11-16 00:30:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:30:59,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:59,932 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] [2019-11-16 00:30:59,933 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 56811971, now seen corresponding path program 1 times [2019-11-16 00:30:59,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:59,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875842368] [2019-11-16 00:30:59,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:59,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:00,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875842368] [2019-11-16 00:31:00,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:00,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:00,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896613127] [2019-11-16 00:31:00,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:00,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:00,046 INFO L87 Difference]: Start difference. First operand 33061 states and 123952 transitions. Second operand 5 states. [2019-11-16 00:31:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:00,659 INFO L93 Difference]: Finished difference Result 40213 states and 148621 transitions. [2019-11-16 00:31:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:31:00,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:31:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:01,290 INFO L225 Difference]: With dead ends: 40213 [2019-11-16 00:31:01,290 INFO L226 Difference]: Without dead ends: 40053 [2019-11-16 00:31:01,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40053 states. [2019-11-16 00:31:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40053 to 34634. [2019-11-16 00:31:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34634 states. [2019-11-16 00:31:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 129248 transitions. [2019-11-16 00:31:02,216 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 129248 transitions. Word has length 46 [2019-11-16 00:31:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:02,217 INFO L462 AbstractCegarLoop]: Abstraction has 34634 states and 129248 transitions. [2019-11-16 00:31:02,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 129248 transitions. [2019-11-16 00:31:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:31:02,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:02,228 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] [2019-11-16 00:31:02,228 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1370736382, now seen corresponding path program 1 times [2019-11-16 00:31:02,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:02,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293749595] [2019-11-16 00:31:02,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:02,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:02,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:02,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293749595] [2019-11-16 00:31:02,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:02,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:02,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648820047] [2019-11-16 00:31:02,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:02,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:02,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:02,333 INFO L87 Difference]: Start difference. First operand 34634 states and 129248 transitions. Second operand 6 states. [2019-11-16 00:31:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:04,008 INFO L93 Difference]: Finished difference Result 45662 states and 166142 transitions. [2019-11-16 00:31:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:31:04,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:31:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:04,131 INFO L225 Difference]: With dead ends: 45662 [2019-11-16 00:31:04,131 INFO L226 Difference]: Without dead ends: 45518 [2019-11-16 00:31:04,132 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-16 00:31:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45518 states. [2019-11-16 00:31:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45518 to 33597. [2019-11-16 00:31:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33597 states. [2019-11-16 00:31:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33597 states to 33597 states and 125403 transitions. [2019-11-16 00:31:04,883 INFO L78 Accepts]: Start accepts. Automaton has 33597 states and 125403 transitions. Word has length 53 [2019-11-16 00:31:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:04,883 INFO L462 AbstractCegarLoop]: Abstraction has 33597 states and 125403 transitions. [2019-11-16 00:31:04,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 33597 states and 125403 transitions. [2019-11-16 00:31:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:31:04,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:04,917 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-16 00:31:04,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 743761970, now seen corresponding path program 1 times [2019-11-16 00:31:04,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:04,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976562224] [2019-11-16 00:31:04,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:04,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:05,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976562224] [2019-11-16 00:31:05,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:05,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:05,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054264354] [2019-11-16 00:31:05,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:05,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:05,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:05,002 INFO L87 Difference]: Start difference. First operand 33597 states and 125403 transitions. Second operand 6 states. [2019-11-16 00:31:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:05,654 INFO L93 Difference]: Finished difference Result 46069 states and 167836 transitions. [2019-11-16 00:31:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:31:05,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:31:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:05,774 INFO L225 Difference]: With dead ends: 46069 [2019-11-16 00:31:05,774 INFO L226 Difference]: Without dead ends: 45829 [2019-11-16 00:31:05,774 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-16 00:31:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45829 states. [2019-11-16 00:31:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45829 to 39958. [2019-11-16 00:31:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-11-16 00:31:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 147327 transitions. [2019-11-16 00:31:07,043 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 147327 transitions. Word has length 60 [2019-11-16 00:31:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:07,044 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 147327 transitions. [2019-11-16 00:31:07,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 147327 transitions. [2019-11-16 00:31:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:31:07,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:07,076 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:07,077 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1264518078, now seen corresponding path program 1 times [2019-11-16 00:31:07,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:07,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653898972] [2019-11-16 00:31:07,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:07,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:07,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:07,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653898972] [2019-11-16 00:31:07,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:07,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:07,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010710326] [2019-11-16 00:31:07,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:31:07,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:31:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:07,131 INFO L87 Difference]: Start difference. First operand 39958 states and 147327 transitions. Second operand 3 states. [2019-11-16 00:31:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:07,406 INFO L93 Difference]: Finished difference Result 50256 states and 182162 transitions. [2019-11-16 00:31:07,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:31:07,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-16 00:31:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:07,515 INFO L225 Difference]: With dead ends: 50256 [2019-11-16 00:31:07,515 INFO L226 Difference]: Without dead ends: 50256 [2019-11-16 00:31:07,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50256 states. [2019-11-16 00:31:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50256 to 43888. [2019-11-16 00:31:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43888 states. [2019-11-16 00:31:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43888 states to 43888 states and 160765 transitions. [2019-11-16 00:31:08,841 INFO L78 Accepts]: Start accepts. Automaton has 43888 states and 160765 transitions. Word has length 62 [2019-11-16 00:31:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:08,842 INFO L462 AbstractCegarLoop]: Abstraction has 43888 states and 160765 transitions. [2019-11-16 00:31:08,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:31:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 43888 states and 160765 transitions. [2019-11-16 00:31:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:31:08,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:08,875 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:08,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1180013829, now seen corresponding path program 1 times [2019-11-16 00:31:08,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:08,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719693805] [2019-11-16 00:31:08,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:08,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:08,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:08,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719693805] [2019-11-16 00:31:08,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:08,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:08,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041673136] [2019-11-16 00:31:08,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:08,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:08,968 INFO L87 Difference]: Start difference. First operand 43888 states and 160765 transitions. Second operand 7 states. [2019-11-16 00:31:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:09,808 INFO L93 Difference]: Finished difference Result 55884 states and 200499 transitions. [2019-11-16 00:31:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:31:09,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-16 00:31:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:09,920 INFO L225 Difference]: With dead ends: 55884 [2019-11-16 00:31:09,920 INFO L226 Difference]: Without dead ends: 55644 [2019-11-16 00:31:09,921 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-16 00:31:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55644 states. [2019-11-16 00:31:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55644 to 45114. [2019-11-16 00:31:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45114 states. [2019-11-16 00:31:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45114 states to 45114 states and 164932 transitions. [2019-11-16 00:31:10,753 INFO L78 Accepts]: Start accepts. Automaton has 45114 states and 164932 transitions. Word has length 66 [2019-11-16 00:31:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:10,754 INFO L462 AbstractCegarLoop]: Abstraction has 45114 states and 164932 transitions. [2019-11-16 00:31:10,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 45114 states and 164932 transitions. [2019-11-16 00:31:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:31:10,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:10,787 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-16 00:31:10,787 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash 709003821, now seen corresponding path program 1 times [2019-11-16 00:31:10,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:10,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061711691] [2019-11-16 00:31:10,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:10,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:10,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:10,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061711691] [2019-11-16 00:31:10,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:10,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:10,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543320432] [2019-11-16 00:31:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:10,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:10,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:10,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:10,928 INFO L87 Difference]: Start difference. First operand 45114 states and 164932 transitions. Second operand 7 states. [2019-11-16 00:31:11,814 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-16 00:31:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:12,181 INFO L93 Difference]: Finished difference Result 55098 states and 197676 transitions. [2019-11-16 00:31:12,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:31:12,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-16 00:31:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:12,294 INFO L225 Difference]: With dead ends: 55098 [2019-11-16 00:31:12,294 INFO L226 Difference]: Without dead ends: 54898 [2019-11-16 00:31:12,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:31:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54898 states. [2019-11-16 00:31:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54898 to 45992. [2019-11-16 00:31:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45992 states. [2019-11-16 00:31:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45992 states to 45992 states and 167803 transitions. [2019-11-16 00:31:13,103 INFO L78 Accepts]: Start accepts. Automaton has 45992 states and 167803 transitions. Word has length 67 [2019-11-16 00:31:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:13,104 INFO L462 AbstractCegarLoop]: Abstraction has 45992 states and 167803 transitions. [2019-11-16 00:31:13,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 45992 states and 167803 transitions. [2019-11-16 00:31:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:31:13,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:13,134 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] [2019-11-16 00:31:13,134 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash 686474922, now seen corresponding path program 1 times [2019-11-16 00:31:13,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:13,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914449229] [2019-11-16 00:31:13,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:13,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:13,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:13,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914449229] [2019-11-16 00:31:13,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:13,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:13,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672267577] [2019-11-16 00:31:13,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:31:13,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:31:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:13,194 INFO L87 Difference]: Start difference. First operand 45992 states and 167803 transitions. Second operand 3 states. [2019-11-16 00:31:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:13,694 INFO L93 Difference]: Finished difference Result 61486 states and 224137 transitions. [2019-11-16 00:31:13,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:31:13,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-16 00:31:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:13,820 INFO L225 Difference]: With dead ends: 61486 [2019-11-16 00:31:13,820 INFO L226 Difference]: Without dead ends: 61486 [2019-11-16 00:31:13,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61486 states. [2019-11-16 00:31:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61486 to 53433. [2019-11-16 00:31:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53433 states. [2019-11-16 00:31:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53433 states to 53433 states and 195616 transitions. [2019-11-16 00:31:15,203 INFO L78 Accepts]: Start accepts. Automaton has 53433 states and 195616 transitions. Word has length 69 [2019-11-16 00:31:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:15,203 INFO L462 AbstractCegarLoop]: Abstraction has 53433 states and 195616 transitions. [2019-11-16 00:31:15,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:31:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 53433 states and 195616 transitions. [2019-11-16 00:31:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:31:15,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:15,251 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:15,252 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2083836118, now seen corresponding path program 1 times [2019-11-16 00:31:15,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:15,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866168092] [2019-11-16 00:31:15,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:15,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:15,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866168092] [2019-11-16 00:31:15,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:15,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:15,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785137923] [2019-11-16 00:31:15,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:15,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:15,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:15,372 INFO L87 Difference]: Start difference. First operand 53433 states and 195616 transitions. Second operand 6 states. [2019-11-16 00:31:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:16,058 INFO L93 Difference]: Finished difference Result 65982 states and 238830 transitions. [2019-11-16 00:31:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:31:16,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-16 00:31:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:16,188 INFO L225 Difference]: With dead ends: 65982 [2019-11-16 00:31:16,188 INFO L226 Difference]: Without dead ends: 65338 [2019-11-16 00:31:16,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65338 states. [2019-11-16 00:31:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65338 to 56042. [2019-11-16 00:31:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56042 states. [2019-11-16 00:31:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56042 states to 56042 states and 204333 transitions. [2019-11-16 00:31:17,179 INFO L78 Accepts]: Start accepts. Automaton has 56042 states and 204333 transitions. Word has length 69 [2019-11-16 00:31:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:17,180 INFO L462 AbstractCegarLoop]: Abstraction has 56042 states and 204333 transitions. [2019-11-16 00:31:17,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 56042 states and 204333 transitions. [2019-11-16 00:31:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:31:17,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:17,233 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] [2019-11-16 00:31:17,233 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1122222101, now seen corresponding path program 1 times [2019-11-16 00:31:17,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:17,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956683460] [2019-11-16 00:31:17,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:17,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:17,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:17,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956683460] [2019-11-16 00:31:17,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:17,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:17,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987356424] [2019-11-16 00:31:17,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:17,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:17,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:17,358 INFO L87 Difference]: Start difference. First operand 56042 states and 204333 transitions. Second operand 7 states. [2019-11-16 00:31:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:18,504 INFO L93 Difference]: Finished difference Result 83030 states and 292761 transitions. [2019-11-16 00:31:18,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:31:18,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-16 00:31:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:18,669 INFO L225 Difference]: With dead ends: 83030 [2019-11-16 00:31:18,670 INFO L226 Difference]: Without dead ends: 83030 [2019-11-16 00:31:18,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:31:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83030 states. [2019-11-16 00:31:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83030 to 76079. [2019-11-16 00:31:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-11-16 00:31:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 270628 transitions. [2019-11-16 00:31:20,498 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 270628 transitions. Word has length 69 [2019-11-16 00:31:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:20,498 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 270628 transitions. [2019-11-16 00:31:20,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 270628 transitions. [2019-11-16 00:31:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:31:20,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:20,555 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] [2019-11-16 00:31:20,555 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 122542380, now seen corresponding path program 1 times [2019-11-16 00:31:20,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:20,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421590875] [2019-11-16 00:31:20,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:20,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:20,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:20,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-16 00:31:20,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421590875] [2019-11-16 00:31:20,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:20,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:20,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026061689] [2019-11-16 00:31:20,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:20,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:20,624 INFO L87 Difference]: Start difference. First operand 76079 states and 270628 transitions. Second operand 4 states. [2019-11-16 00:31:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:20,727 INFO L93 Difference]: Finished difference Result 17224 states and 54506 transitions. [2019-11-16 00:31:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:20,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-16 00:31:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:20,757 INFO L225 Difference]: With dead ends: 17224 [2019-11-16 00:31:20,758 INFO L226 Difference]: Without dead ends: 16746 [2019-11-16 00:31:20,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16746 states. [2019-11-16 00:31:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16746 to 16734. [2019-11-16 00:31:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16734 states. [2019-11-16 00:31:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16734 states to 16734 states and 53001 transitions. [2019-11-16 00:31:20,963 INFO L78 Accepts]: Start accepts. Automaton has 16734 states and 53001 transitions. Word has length 69 [2019-11-16 00:31:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:20,963 INFO L462 AbstractCegarLoop]: Abstraction has 16734 states and 53001 transitions. [2019-11-16 00:31:20,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 16734 states and 53001 transitions. [2019-11-16 00:31:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:31:20,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:20,974 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] [2019-11-16 00:31:20,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:20,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:20,975 INFO L82 PathProgramCache]: Analyzing trace with hash -789423278, now seen corresponding path program 1 times [2019-11-16 00:31:20,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:20,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758549634] [2019-11-16 00:31:20,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:20,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:20,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:21,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-16 00:31:21,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758549634] [2019-11-16 00:31:21,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:21,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:21,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722469810] [2019-11-16 00:31:21,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:21,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:21,055 INFO L87 Difference]: Start difference. First operand 16734 states and 53001 transitions. Second operand 4 states. [2019-11-16 00:31:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:21,277 INFO L93 Difference]: Finished difference Result 22098 states and 69082 transitions. [2019-11-16 00:31:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:21,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-16 00:31:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:21,319 INFO L225 Difference]: With dead ends: 22098 [2019-11-16 00:31:21,320 INFO L226 Difference]: Without dead ends: 22098 [2019-11-16 00:31:21,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22098 states. [2019-11-16 00:31:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22098 to 17610. [2019-11-16 00:31:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17610 states. [2019-11-16 00:31:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17610 states to 17610 states and 55560 transitions. [2019-11-16 00:31:21,616 INFO L78 Accepts]: Start accepts. Automaton has 17610 states and 55560 transitions. Word has length 79 [2019-11-16 00:31:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:21,616 INFO L462 AbstractCegarLoop]: Abstraction has 17610 states and 55560 transitions. [2019-11-16 00:31:21,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17610 states and 55560 transitions. [2019-11-16 00:31:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:31:21,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:21,628 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] [2019-11-16 00:31:21,628 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1044159823, now seen corresponding path program 1 times [2019-11-16 00:31:21,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:21,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29531244] [2019-11-16 00:31:21,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:21,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:21,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:21,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29531244] [2019-11-16 00:31:21,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:21,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:31:21,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360477948] [2019-11-16 00:31:21,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:31:21,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:21,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:31:21,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:21,736 INFO L87 Difference]: Start difference. First operand 17610 states and 55560 transitions. Second operand 8 states. [2019-11-16 00:31:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:22,837 INFO L93 Difference]: Finished difference Result 19704 states and 61636 transitions. [2019-11-16 00:31:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:31:22,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-11-16 00:31:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:22,865 INFO L225 Difference]: With dead ends: 19704 [2019-11-16 00:31:22,865 INFO L226 Difference]: Without dead ends: 19656 [2019-11-16 00:31:22,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:31:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19656 states. [2019-11-16 00:31:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19656 to 15528. [2019-11-16 00:31:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15528 states. [2019-11-16 00:31:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15528 states to 15528 states and 49294 transitions. [2019-11-16 00:31:23,083 INFO L78 Accepts]: Start accepts. Automaton has 15528 states and 49294 transitions. Word has length 79 [2019-11-16 00:31:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:23,083 INFO L462 AbstractCegarLoop]: Abstraction has 15528 states and 49294 transitions. [2019-11-16 00:31:23,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:31:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 49294 transitions. [2019-11-16 00:31:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:31:23,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:23,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:23,094 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash 705159786, now seen corresponding path program 1 times [2019-11-16 00:31:23,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:23,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40368571] [2019-11-16 00:31:23,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:23,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:23,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:23,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40368571] [2019-11-16 00:31:23,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:23,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:23,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314751189] [2019-11-16 00:31:23,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:31:23,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:31:23,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:23,133 INFO L87 Difference]: Start difference. First operand 15528 states and 49294 transitions. Second operand 3 states. [2019-11-16 00:31:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:23,343 INFO L93 Difference]: Finished difference Result 16792 states and 53007 transitions. [2019-11-16 00:31:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:31:23,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-16 00:31:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:23,370 INFO L225 Difference]: With dead ends: 16792 [2019-11-16 00:31:23,370 INFO L226 Difference]: Without dead ends: 16792 [2019-11-16 00:31:23,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16792 states. [2019-11-16 00:31:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16792 to 16144. [2019-11-16 00:31:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16144 states. [2019-11-16 00:31:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16144 states to 16144 states and 51108 transitions. [2019-11-16 00:31:23,591 INFO L78 Accepts]: Start accepts. Automaton has 16144 states and 51108 transitions. Word has length 80 [2019-11-16 00:31:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:23,592 INFO L462 AbstractCegarLoop]: Abstraction has 16144 states and 51108 transitions. [2019-11-16 00:31:23,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:31:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 16144 states and 51108 transitions. [2019-11-16 00:31:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:31:23,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:23,603 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2052355460, now seen corresponding path program 1 times [2019-11-16 00:31:23,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:23,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304290003] [2019-11-16 00:31:23,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:23,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:23,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:23,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304290003] [2019-11-16 00:31:23,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:23,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:23,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896179484] [2019-11-16 00:31:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:23,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:23,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:23,658 INFO L87 Difference]: Start difference. First operand 16144 states and 51108 transitions. Second operand 4 states. [2019-11-16 00:31:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:24,010 INFO L93 Difference]: Finished difference Result 19272 states and 60154 transitions. [2019-11-16 00:31:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:24,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-16 00:31:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:24,038 INFO L225 Difference]: With dead ends: 19272 [2019-11-16 00:31:24,038 INFO L226 Difference]: Without dead ends: 19272 [2019-11-16 00:31:24,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19272 states. [2019-11-16 00:31:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19272 to 18249. [2019-11-16 00:31:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18249 states. [2019-11-16 00:31:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18249 states to 18249 states and 57270 transitions. [2019-11-16 00:31:24,396 INFO L78 Accepts]: Start accepts. Automaton has 18249 states and 57270 transitions. Word has length 81 [2019-11-16 00:31:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:24,396 INFO L462 AbstractCegarLoop]: Abstraction has 18249 states and 57270 transitions. [2019-11-16 00:31:24,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18249 states and 57270 transitions. [2019-11-16 00:31:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:31:24,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:24,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:24,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash 306951549, now seen corresponding path program 1 times [2019-11-16 00:31:24,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:24,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962117201] [2019-11-16 00:31:24,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:24,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:24,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:24,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962117201] [2019-11-16 00:31:24,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:24,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:24,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386635883] [2019-11-16 00:31:24,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:31:24,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:31:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:24,453 INFO L87 Difference]: Start difference. First operand 18249 states and 57270 transitions. Second operand 3 states. [2019-11-16 00:31:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:24,704 INFO L93 Difference]: Finished difference Result 19580 states and 61169 transitions. [2019-11-16 00:31:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:31:24,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-16 00:31:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:24,734 INFO L225 Difference]: With dead ends: 19580 [2019-11-16 00:31:24,734 INFO L226 Difference]: Without dead ends: 19580 [2019-11-16 00:31:24,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:31:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19580 states. [2019-11-16 00:31:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19580 to 18921. [2019-11-16 00:31:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18921 states. [2019-11-16 00:31:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18921 states to 18921 states and 59234 transitions. [2019-11-16 00:31:24,983 INFO L78 Accepts]: Start accepts. Automaton has 18921 states and 59234 transitions. Word has length 81 [2019-11-16 00:31:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:24,983 INFO L462 AbstractCegarLoop]: Abstraction has 18921 states and 59234 transitions. [2019-11-16 00:31:24,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:31:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18921 states and 59234 transitions. [2019-11-16 00:31:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:31:24,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:24,999 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] [2019-11-16 00:31:24,999 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash 494100654, now seen corresponding path program 1 times [2019-11-16 00:31:25,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:25,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254858977] [2019-11-16 00:31:25,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:25,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:25,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:25,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254858977] [2019-11-16 00:31:25,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:25,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:25,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682150020] [2019-11-16 00:31:25,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:25,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:25,058 INFO L87 Difference]: Start difference. First operand 18921 states and 59234 transitions. Second operand 4 states. [2019-11-16 00:31:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:25,439 INFO L93 Difference]: Finished difference Result 31886 states and 99190 transitions. [2019-11-16 00:31:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:25,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-16 00:31:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:25,487 INFO L225 Difference]: With dead ends: 31886 [2019-11-16 00:31:25,487 INFO L226 Difference]: Without dead ends: 31886 [2019-11-16 00:31:25,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31886 states. [2019-11-16 00:31:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31886 to 17558. [2019-11-16 00:31:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17558 states. [2019-11-16 00:31:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17558 states to 17558 states and 54308 transitions. [2019-11-16 00:31:25,769 INFO L78 Accepts]: Start accepts. Automaton has 17558 states and 54308 transitions. Word has length 82 [2019-11-16 00:31:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:25,769 INFO L462 AbstractCegarLoop]: Abstraction has 17558 states and 54308 transitions. [2019-11-16 00:31:25,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17558 states and 54308 transitions. [2019-11-16 00:31:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:31:25,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:25,784 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] [2019-11-16 00:31:25,784 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:25,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 823866415, now seen corresponding path program 1 times [2019-11-16 00:31:25,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:25,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924048015] [2019-11-16 00:31:25,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:25,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:25,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:25,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924048015] [2019-11-16 00:31:25,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:25,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:25,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463769989] [2019-11-16 00:31:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:25,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:25,881 INFO L87 Difference]: Start difference. First operand 17558 states and 54308 transitions. Second operand 6 states. [2019-11-16 00:31:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:26,548 INFO L93 Difference]: Finished difference Result 25982 states and 78626 transitions. [2019-11-16 00:31:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:31:26,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:31:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:26,585 INFO L225 Difference]: With dead ends: 25982 [2019-11-16 00:31:26,585 INFO L226 Difference]: Without dead ends: 25676 [2019-11-16 00:31:26,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:31:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25676 states. [2019-11-16 00:31:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25676 to 20546. [2019-11-16 00:31:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20546 states. [2019-11-16 00:31:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20546 states to 20546 states and 63287 transitions. [2019-11-16 00:31:26,869 INFO L78 Accepts]: Start accepts. Automaton has 20546 states and 63287 transitions. Word has length 82 [2019-11-16 00:31:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:26,869 INFO L462 AbstractCegarLoop]: Abstraction has 20546 states and 63287 transitions. [2019-11-16 00:31:26,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 20546 states and 63287 transitions. [2019-11-16 00:31:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:31:26,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:26,886 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] [2019-11-16 00:31:26,887 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1785480432, now seen corresponding path program 1 times [2019-11-16 00:31:26,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:26,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033089943] [2019-11-16 00:31:26,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:26,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:26,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:26,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033089943] [2019-11-16 00:31:26,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:26,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:26,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096228102] [2019-11-16 00:31:26,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:26,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:26,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:26,979 INFO L87 Difference]: Start difference. First operand 20546 states and 63287 transitions. Second operand 7 states. [2019-11-16 00:31:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:27,882 INFO L93 Difference]: Finished difference Result 38183 states and 115440 transitions. [2019-11-16 00:31:27,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:31:27,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:31:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:27,938 INFO L225 Difference]: With dead ends: 38183 [2019-11-16 00:31:27,938 INFO L226 Difference]: Without dead ends: 38111 [2019-11-16 00:31:27,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:31:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38111 states. [2019-11-16 00:31:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38111 to 23772. [2019-11-16 00:31:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23772 states. [2019-11-16 00:31:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23772 states to 23772 states and 73008 transitions. [2019-11-16 00:31:28,321 INFO L78 Accepts]: Start accepts. Automaton has 23772 states and 73008 transitions. Word has length 82 [2019-11-16 00:31:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:28,322 INFO L462 AbstractCegarLoop]: Abstraction has 23772 states and 73008 transitions. [2019-11-16 00:31:28,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 23772 states and 73008 transitions. [2019-11-16 00:31:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:31:28,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:28,340 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] [2019-11-16 00:31:28,340 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1264722383, now seen corresponding path program 1 times [2019-11-16 00:31:28,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:28,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336602298] [2019-11-16 00:31:28,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:28,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:28,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:28,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336602298] [2019-11-16 00:31:28,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:28,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:28,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120663192] [2019-11-16 00:31:28,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:28,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:28,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:28,432 INFO L87 Difference]: Start difference. First operand 23772 states and 73008 transitions. Second operand 6 states. [2019-11-16 00:31:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:28,680 INFO L93 Difference]: Finished difference Result 24820 states and 75815 transitions. [2019-11-16 00:31:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:31:28,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:31:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:28,714 INFO L225 Difference]: With dead ends: 24820 [2019-11-16 00:31:28,714 INFO L226 Difference]: Without dead ends: 24820 [2019-11-16 00:31:28,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2019-11-16 00:31:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 24470. [2019-11-16 00:31:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24470 states. [2019-11-16 00:31:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24470 states to 24470 states and 74913 transitions. [2019-11-16 00:31:29,014 INFO L78 Accepts]: Start accepts. Automaton has 24470 states and 74913 transitions. Word has length 82 [2019-11-16 00:31:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:29,014 INFO L462 AbstractCegarLoop]: Abstraction has 24470 states and 74913 transitions. [2019-11-16 00:31:29,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24470 states and 74913 transitions. [2019-11-16 00:31:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:31:29,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:29,033 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] [2019-11-16 00:31:29,033 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash -98817168, now seen corresponding path program 1 times [2019-11-16 00:31:29,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:29,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784420961] [2019-11-16 00:31:29,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:29,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:29,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:29,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784420961] [2019-11-16 00:31:29,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:29,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:29,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368528933] [2019-11-16 00:31:29,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:29,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:29,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:29,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:29,131 INFO L87 Difference]: Start difference. First operand 24470 states and 74913 transitions. Second operand 6 states. [2019-11-16 00:31:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:29,749 INFO L93 Difference]: Finished difference Result 36680 states and 111433 transitions. [2019-11-16 00:31:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:31:29,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:31:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:29,799 INFO L225 Difference]: With dead ends: 36680 [2019-11-16 00:31:29,799 INFO L226 Difference]: Without dead ends: 36680 [2019-11-16 00:31:29,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:31:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36680 states. [2019-11-16 00:31:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36680 to 27101. [2019-11-16 00:31:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27101 states. [2019-11-16 00:31:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27101 states to 27101 states and 82607 transitions. [2019-11-16 00:31:30,224 INFO L78 Accepts]: Start accepts. Automaton has 27101 states and 82607 transitions. Word has length 82 [2019-11-16 00:31:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:30,224 INFO L462 AbstractCegarLoop]: Abstraction has 27101 states and 82607 transitions. [2019-11-16 00:31:30,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27101 states and 82607 transitions. [2019-11-16 00:31:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:31:30,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:30,248 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] [2019-11-16 00:31:30,248 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1145947313, now seen corresponding path program 1 times [2019-11-16 00:31:30,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:30,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943051683] [2019-11-16 00:31:30,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:30,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943051683] [2019-11-16 00:31:30,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:30,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:30,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313239967] [2019-11-16 00:31:30,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:30,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:30,316 INFO L87 Difference]: Start difference. First operand 27101 states and 82607 transitions. Second operand 5 states. [2019-11-16 00:31:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:30,374 INFO L93 Difference]: Finished difference Result 4094 states and 10017 transitions. [2019-11-16 00:31:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:31:30,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-16 00:31:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:30,378 INFO L225 Difference]: With dead ends: 4094 [2019-11-16 00:31:30,379 INFO L226 Difference]: Without dead ends: 3377 [2019-11-16 00:31:30,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2019-11-16 00:31:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 2765. [2019-11-16 00:31:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2019-11-16 00:31:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 6782 transitions. [2019-11-16 00:31:30,418 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 6782 transitions. Word has length 82 [2019-11-16 00:31:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:30,418 INFO L462 AbstractCegarLoop]: Abstraction has 2765 states and 6782 transitions. [2019-11-16 00:31:30,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 6782 transitions. [2019-11-16 00:31:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:31:30,421 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:30,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:30,422 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1234975873, now seen corresponding path program 1 times [2019-11-16 00:31:30,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:30,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712571192] [2019-11-16 00:31:30,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:30,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712571192] [2019-11-16 00:31:30,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:30,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:30,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303809592] [2019-11-16 00:31:30,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:30,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:30,567 INFO L87 Difference]: Start difference. First operand 2765 states and 6782 transitions. Second operand 7 states. [2019-11-16 00:31:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:30,800 INFO L93 Difference]: Finished difference Result 3259 states and 7915 transitions. [2019-11-16 00:31:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:31:30,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-16 00:31:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:30,804 INFO L225 Difference]: With dead ends: 3259 [2019-11-16 00:31:30,804 INFO L226 Difference]: Without dead ends: 3223 [2019-11-16 00:31:30,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:31:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2019-11-16 00:31:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2663. [2019-11-16 00:31:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2663 states. [2019-11-16 00:31:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 6497 transitions. [2019-11-16 00:31:30,839 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 6497 transitions. Word has length 94 [2019-11-16 00:31:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:30,839 INFO L462 AbstractCegarLoop]: Abstraction has 2663 states and 6497 transitions. [2019-11-16 00:31:30,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 6497 transitions. [2019-11-16 00:31:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:31:30,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:30,842 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:30,842 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -984924812, now seen corresponding path program 1 times [2019-11-16 00:31:30,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:30,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834905340] [2019-11-16 00:31:30,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:30,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834905340] [2019-11-16 00:31:30,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:30,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:30,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899584914] [2019-11-16 00:31:30,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:30,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:30,966 INFO L87 Difference]: Start difference. First operand 2663 states and 6497 transitions. Second operand 6 states. [2019-11-16 00:31:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:31,165 INFO L93 Difference]: Finished difference Result 2969 states and 7068 transitions. [2019-11-16 00:31:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:31:31,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:31:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:31,169 INFO L225 Difference]: With dead ends: 2969 [2019-11-16 00:31:31,169 INFO L226 Difference]: Without dead ends: 2915 [2019-11-16 00:31:31,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2019-11-16 00:31:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2659. [2019-11-16 00:31:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2659 states. [2019-11-16 00:31:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 6456 transitions. [2019-11-16 00:31:31,209 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 6456 transitions. Word has length 94 [2019-11-16 00:31:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:31,209 INFO L462 AbstractCegarLoop]: Abstraction has 2659 states and 6456 transitions. [2019-11-16 00:31:31,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 6456 transitions. [2019-11-16 00:31:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:31:31,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:31,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:31,214 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 139818385, now seen corresponding path program 1 times [2019-11-16 00:31:31,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935430460] [2019-11-16 00:31:31,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:31,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935430460] [2019-11-16 00:31:31,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:31,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:31,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937399274] [2019-11-16 00:31:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:31,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:31,316 INFO L87 Difference]: Start difference. First operand 2659 states and 6456 transitions. Second operand 6 states. [2019-11-16 00:31:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:31,641 INFO L93 Difference]: Finished difference Result 4796 states and 11748 transitions. [2019-11-16 00:31:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:31:31,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:31:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:31,648 INFO L225 Difference]: With dead ends: 4796 [2019-11-16 00:31:31,648 INFO L226 Difference]: Without dead ends: 4796 [2019-11-16 00:31:31,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2019-11-16 00:31:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 2657. [2019-11-16 00:31:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2657 states. [2019-11-16 00:31:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 6450 transitions. [2019-11-16 00:31:31,706 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 6450 transitions. Word has length 94 [2019-11-16 00:31:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:31,707 INFO L462 AbstractCegarLoop]: Abstraction has 2657 states and 6450 transitions. [2019-11-16 00:31:31,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 6450 transitions. [2019-11-16 00:31:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:31:31,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:31,711 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:31,711 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash 639784367, now seen corresponding path program 1 times [2019-11-16 00:31:31,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60157704] [2019-11-16 00:31:31,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:31,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60157704] [2019-11-16 00:31:31,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:31,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:31,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945744238] [2019-11-16 00:31:31,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:31,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:31,848 INFO L87 Difference]: Start difference. First operand 2657 states and 6450 transitions. Second operand 7 states. [2019-11-16 00:31:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:32,354 INFO L93 Difference]: Finished difference Result 3739 states and 8931 transitions. [2019-11-16 00:31:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:31:32,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-16 00:31:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:32,359 INFO L225 Difference]: With dead ends: 3739 [2019-11-16 00:31:32,359 INFO L226 Difference]: Without dead ends: 3703 [2019-11-16 00:31:32,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:31:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2019-11-16 00:31:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 2804. [2019-11-16 00:31:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2019-11-16 00:31:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 6749 transitions. [2019-11-16 00:31:32,432 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 6749 transitions. Word has length 94 [2019-11-16 00:31:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:32,432 INFO L462 AbstractCegarLoop]: Abstraction has 2804 states and 6749 transitions. [2019-11-16 00:31:32,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 6749 transitions. [2019-11-16 00:31:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:31:32,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:32,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:32,436 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1601398384, now seen corresponding path program 1 times [2019-11-16 00:31:32,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:32,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692793111] [2019-11-16 00:31:32,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:32,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:32,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:32,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692793111] [2019-11-16 00:31:32,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:32,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:31:32,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778425774] [2019-11-16 00:31:32,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:31:32,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:32,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:31:32,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:32,556 INFO L87 Difference]: Start difference. First operand 2804 states and 6749 transitions. Second operand 8 states. [2019-11-16 00:31:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:32,940 INFO L93 Difference]: Finished difference Result 7635 states and 19085 transitions. [2019-11-16 00:31:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:31:32,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-16 00:31:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:32,947 INFO L225 Difference]: With dead ends: 7635 [2019-11-16 00:31:32,948 INFO L226 Difference]: Without dead ends: 7635 [2019-11-16 00:31:32,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:31:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2019-11-16 00:31:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 2514. [2019-11-16 00:31:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-11-16 00:31:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 5938 transitions. [2019-11-16 00:31:33,002 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 5938 transitions. Word has length 94 [2019-11-16 00:31:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:33,003 INFO L462 AbstractCegarLoop]: Abstraction has 2514 states and 5938 transitions. [2019-11-16 00:31:33,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:31:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 5938 transitions. [2019-11-16 00:31:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:31:33,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:33,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:33,005 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2082114800, now seen corresponding path program 1 times [2019-11-16 00:31:33,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107511362] [2019-11-16 00:31:33,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:33,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107511362] [2019-11-16 00:31:33,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:33,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:33,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357928700] [2019-11-16 00:31:33,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:33,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:33,116 INFO L87 Difference]: Start difference. First operand 2514 states and 5938 transitions. Second operand 6 states. [2019-11-16 00:31:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:33,336 INFO L93 Difference]: Finished difference Result 2379 states and 5497 transitions. [2019-11-16 00:31:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:31:33,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-16 00:31:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:33,340 INFO L225 Difference]: With dead ends: 2379 [2019-11-16 00:31:33,340 INFO L226 Difference]: Without dead ends: 2379 [2019-11-16 00:31:33,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2019-11-16 00:31:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1773. [2019-11-16 00:31:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-11-16 00:31:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 4189 transitions. [2019-11-16 00:31:33,365 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 4189 transitions. Word has length 94 [2019-11-16 00:31:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:33,366 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 4189 transitions. [2019-11-16 00:31:33,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 4189 transitions. [2019-11-16 00:31:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:31:33,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:33,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:33,368 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 646819500, now seen corresponding path program 1 times [2019-11-16 00:31:33,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706861372] [2019-11-16 00:31:33,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:33,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706861372] [2019-11-16 00:31:33,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:33,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:33,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628330162] [2019-11-16 00:31:33,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:33,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:33,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:33,453 INFO L87 Difference]: Start difference. First operand 1773 states and 4189 transitions. Second operand 7 states. [2019-11-16 00:31:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:33,921 INFO L93 Difference]: Finished difference Result 2667 states and 6170 transitions. [2019-11-16 00:31:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:31:33,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-11-16 00:31:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:33,924 INFO L225 Difference]: With dead ends: 2667 [2019-11-16 00:31:33,924 INFO L226 Difference]: Without dead ends: 2649 [2019-11-16 00:31:33,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:31:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-11-16 00:31:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2108. [2019-11-16 00:31:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2108 states. [2019-11-16 00:31:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 4959 transitions. [2019-11-16 00:31:33,955 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 4959 transitions. Word has length 96 [2019-11-16 00:31:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:33,956 INFO L462 AbstractCegarLoop]: Abstraction has 2108 states and 4959 transitions. [2019-11-16 00:31:33,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:31:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 4959 transitions. [2019-11-16 00:31:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:31:33,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:33,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:33,959 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1891583981, now seen corresponding path program 1 times [2019-11-16 00:31:33,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845888866] [2019-11-16 00:31:33,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:34,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845888866] [2019-11-16 00:31:34,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:34,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:31:34,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182512586] [2019-11-16 00:31:34,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:34,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:34,051 INFO L87 Difference]: Start difference. First operand 2108 states and 4959 transitions. Second operand 6 states. [2019-11-16 00:31:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:34,180 INFO L93 Difference]: Finished difference Result 1881 states and 4385 transitions. [2019-11-16 00:31:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:31:34,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-16 00:31:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:34,182 INFO L225 Difference]: With dead ends: 1881 [2019-11-16 00:31:34,182 INFO L226 Difference]: Without dead ends: 1881 [2019-11-16 00:31:34,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:31:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-11-16 00:31:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1809. [2019-11-16 00:31:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-11-16 00:31:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 4249 transitions. [2019-11-16 00:31:34,198 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 4249 transitions. Word has length 96 [2019-11-16 00:31:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:34,198 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 4249 transitions. [2019-11-16 00:31:34,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 4249 transitions. [2019-11-16 00:31:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:31:34,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:34,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:34,200 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1288840787, now seen corresponding path program 1 times [2019-11-16 00:31:34,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:34,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127136013] [2019-11-16 00:31:34,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:34,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:34,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:34,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127136013] [2019-11-16 00:31:34,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:34,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:34,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290845909] [2019-11-16 00:31:34,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:34,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:34,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:34,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:34,272 INFO L87 Difference]: Start difference. First operand 1809 states and 4249 transitions. Second operand 5 states. [2019-11-16 00:31:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:34,421 INFO L93 Difference]: Finished difference Result 2061 states and 4828 transitions. [2019-11-16 00:31:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:31:34,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-16 00:31:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:34,423 INFO L225 Difference]: With dead ends: 2061 [2019-11-16 00:31:34,423 INFO L226 Difference]: Without dead ends: 2043 [2019-11-16 00:31:34,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-11-16 00:31:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1836. [2019-11-16 00:31:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-11-16 00:31:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4303 transitions. [2019-11-16 00:31:34,441 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4303 transitions. Word has length 96 [2019-11-16 00:31:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:34,441 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 4303 transitions. [2019-11-16 00:31:34,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4303 transitions. [2019-11-16 00:31:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:31:34,442 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:34,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:34,443 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -44076306, now seen corresponding path program 1 times [2019-11-16 00:31:34,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:34,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425050209] [2019-11-16 00:31:34,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:34,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:34,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:31:34,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425050209] [2019-11-16 00:31:34,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:34,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:31:34,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212389235] [2019-11-16 00:31:34,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:31:34,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:34,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:31:34,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:34,565 INFO L87 Difference]: Start difference. First operand 1836 states and 4303 transitions. Second operand 8 states. [2019-11-16 00:31:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:34,668 INFO L93 Difference]: Finished difference Result 3027 states and 7191 transitions. [2019-11-16 00:31:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:31:34,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-11-16 00:31:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:34,671 INFO L225 Difference]: With dead ends: 3027 [2019-11-16 00:31:34,671 INFO L226 Difference]: Without dead ends: 1262 [2019-11-16 00:31:34,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:31:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-11-16 00:31:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1210. [2019-11-16 00:31:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-16 00:31:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2897 transitions. [2019-11-16 00:31:34,689 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2897 transitions. Word has length 96 [2019-11-16 00:31:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:34,690 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 2897 transitions. [2019-11-16 00:31:34,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:31:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2897 transitions. [2019-11-16 00:31:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:31:34,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:34,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:34,692 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1574294956, now seen corresponding path program 2 times [2019-11-16 00:31:34,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:34,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374398081] [2019-11-16 00:31:34,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:34,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:34,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:34,805 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:34,805 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:31:34,967 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:31:34,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:31:34 BasicIcfg [2019-11-16 00:31:34,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:31:34,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:31:34,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:31:34,970 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:31:34,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:53" (3/4) ... [2019-11-16 00:31:34,974 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:31:35,104 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_61d2470c-6f28-4e4c-bf1c-de4c8b2fd642/bin/uautomizer/witness.graphml [2019-11-16 00:31:35,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:31:35,106 INFO L168 Benchmark]: Toolchain (without parser) took 43542.06 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 944.7 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:31:35,106 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:35,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:35,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:35,107 INFO L168 Benchmark]: Boogie Preprocessor took 38.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:35,108 INFO L168 Benchmark]: RCFGBuilder took 802.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:35,108 INFO L168 Benchmark]: TraceAbstraction took 41743.45 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:31:35,108 INFO L168 Benchmark]: Witness Printer took 134.75 ms. Allocated memory is still 4.6 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 86.3 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:35,110 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.97 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 802.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41743.45 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 134.75 ms. Allocated memory is still 4.6 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 86.3 MB). Peak memory consumption was 86.3 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] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 0 pthread_t t1103; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 0 pthread_t t1104; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 2 x$w_buff1 = x$w_buff0 [L747] 2 x$w_buff0 = 2 [L748] 2 x$w_buff1_used = x$w_buff0_used [L749] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 0 x = x$flush_delayed ? x$mem_tmp : x [L817] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 177 locations, 3 error locations. Result: UNSAFE, OverallTime: 41.6s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9348 SDtfs, 9367 SDslu, 21292 SDs, 0 SdLazy, 9353 SolverSat, 603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 93 SyntacticMatches, 14 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76079occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 140564 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2649 NumberOfCodeBlocks, 2649 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2520 ConstructedInterpolants, 0 QuantifiedInterpolants, 480338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...