./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe010_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe010_power.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c319566bf131c36d8589e8b38663c5e9805f0d75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-13 04:30:31,463 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 04:30:31,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 04:30:31,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 04:30:31,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 04:30:31,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 04:30:31,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 04:30:31,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 04:30:31,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 04:30:31,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 04:30:31,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 04:30:31,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 04:30:31,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 04:30:31,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 04:30:31,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 04:30:31,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 04:30:31,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 04:30:31,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 04:30:31,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 04:30:31,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 04:30:31,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 04:30:31,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 04:30:31,516 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 04:30:31,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 04:30:31,517 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 04:30:31,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 04:30:31,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 04:30:31,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 04:30:31,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 04:30:31,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 04:30:31,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 04:30:31,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 04:30:31,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 04:30:31,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 04:30:31,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 04:30:31,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 04:30:31,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 04:30:31,565 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 04:30:31,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 04:30:31,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 04:30:31,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 04:30:31,567 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 04:30:31,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 04:30:31,567 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 04:30:31,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 04:30:31,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 04:30:31,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 04:30:31,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 04:30:31,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 04:30:31,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 04:30:31,568 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 04:30:31,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 04:30:31,569 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 04:30:31,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 04:30:31,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 04:30:31,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 04:30:31,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 04:30:31,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 04:30:31,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 04:30:31,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 04:30:31,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 04:30:31,570 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 04:30:31,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 04:30:31,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 04:30:31,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 04:30:31,571 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c319566bf131c36d8589e8b38663c5e9805f0d75 [2019-01-13 04:30:31,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 04:30:31,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 04:30:31,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 04:30:31,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 04:30:31,652 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 04:30:31,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe010_power.oepc_false-unreach-call.i [2019-01-13 04:30:31,718 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ba41a0e/2ef281e5b8444f668770763d4a0f37ea/FLAG2dc7d53ee [2019-01-13 04:30:32,222 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 04:30:32,222 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe010_power.oepc_false-unreach-call.i [2019-01-13 04:30:32,246 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ba41a0e/2ef281e5b8444f668770763d4a0f37ea/FLAG2dc7d53ee [2019-01-13 04:30:32,515 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ba41a0e/2ef281e5b8444f668770763d4a0f37ea [2019-01-13 04:30:32,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 04:30:32,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 04:30:32,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 04:30:32,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 04:30:32,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 04:30:32,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:30:32" (1/1) ... [2019-01-13 04:30:32,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7559aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:32, skipping insertion in model container [2019-01-13 04:30:32,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:30:32" (1/1) ... [2019-01-13 04:30:32,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 04:30:32,620 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 04:30:33,020 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:30:33,034 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 04:30:33,186 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:30:33,275 INFO L195 MainTranslator]: Completed translation [2019-01-13 04:30:33,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33 WrapperNode [2019-01-13 04:30:33,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 04:30:33,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 04:30:33,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 04:30:33,278 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 04:30:33,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 04:30:33,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 04:30:33,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 04:30:33,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 04:30:33,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... [2019-01-13 04:30:33,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 04:30:33,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 04:30:33,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 04:30:33,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 04:30:33,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-13 04:30:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 04:30:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 04:30:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 04:30:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 04:30:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 04:30:33,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 04:30:33,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 04:30:33,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 04:30:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 04:30:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 04:30:33,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 04:30:33,473 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 04:30:34,618 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 04:30:34,619 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 04:30:34,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:30:34 BoogieIcfgContainer [2019-01-13 04:30:34,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 04:30:34,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 04:30:34,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 04:30:34,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 04:30:34,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 04:30:32" (1/3) ... [2019-01-13 04:30:34,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2740c4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:30:34, skipping insertion in model container [2019-01-13 04:30:34,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:33" (2/3) ... [2019-01-13 04:30:34,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2740c4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:30:34, skipping insertion in model container [2019-01-13 04:30:34,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:30:34" (3/3) ... [2019-01-13 04:30:34,630 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_false-unreach-call.i [2019-01-13 04:30:34,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,672 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,672 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,673 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,673 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,674 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,682 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,682 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:34,722 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 04:30:34,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 04:30:34,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 04:30:34,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 04:30:34,769 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 04:30:34,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 04:30:34,770 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 04:30:34,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 04:30:34,770 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 04:30:34,770 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 04:30:34,770 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 04:30:34,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 04:30:34,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 04:30:34,783 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 04:30:36,912 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2019-01-13 04:30:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2019-01-13 04:30:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 04:30:36,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:36,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:30:36,934 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2019-01-13 04:30:36,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:36,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:37,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:37,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:37,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:37,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:37,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:37,496 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2019-01-13 04:30:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:39,121 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2019-01-13 04:30:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:30:39,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-13 04:30:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:39,590 INFO L225 Difference]: With dead ends: 45395 [2019-01-13 04:30:39,591 INFO L226 Difference]: Without dead ends: 40635 [2019-01-13 04:30:39,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2019-01-13 04:30:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2019-01-13 04:30:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2019-01-13 04:30:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2019-01-13 04:30:41,714 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2019-01-13 04:30:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:41,714 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2019-01-13 04:30:41,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:30:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2019-01-13 04:30:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 04:30:41,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:41,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:30:41,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2019-01-13 04:30:41,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:41,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:41,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:30:42,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:30:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:30:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:30:42,117 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2019-01-13 04:30:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:47,184 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2019-01-13 04:30:47,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:30:47,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 04:30:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:47,516 INFO L225 Difference]: With dead ends: 64837 [2019-01-13 04:30:47,516 INFO L226 Difference]: Without dead ends: 64677 [2019-01-13 04:30:47,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:30:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2019-01-13 04:30:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2019-01-13 04:30:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2019-01-13 04:30:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2019-01-13 04:30:49,430 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2019-01-13 04:30:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:49,435 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2019-01-13 04:30:49,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:30:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2019-01-13 04:30:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 04:30:49,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:49,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:30:49,448 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2019-01-13 04:30:49,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:49,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:49,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:49,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:49,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:49,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:49,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:49,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:49,689 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2019-01-13 04:30:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:50,013 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2019-01-13 04:30:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:30:50,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 04:30:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:50,058 INFO L225 Difference]: With dead ends: 12371 [2019-01-13 04:30:50,059 INFO L226 Difference]: Without dead ends: 11850 [2019-01-13 04:30:50,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:30:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2019-01-13 04:30:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2019-01-13 04:30:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2019-01-13 04:30:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2019-01-13 04:30:50,378 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2019-01-13 04:30:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:50,378 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2019-01-13 04:30:50,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:30:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2019-01-13 04:30:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:30:50,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:50,390 INFO L402 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] [2019-01-13 04:30:50,391 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2019-01-13 04:30:50,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:50,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:50,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:50,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:50,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:50,714 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2019-01-13 04:30:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:52,279 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2019-01-13 04:30:52,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:30:52,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 04:30:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:52,378 INFO L225 Difference]: With dead ends: 17026 [2019-01-13 04:30:52,378 INFO L226 Difference]: Without dead ends: 17026 [2019-01-13 04:30:52,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:30:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2019-01-13 04:30:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2019-01-13 04:30:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2019-01-13 04:30:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2019-01-13 04:30:52,863 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2019-01-13 04:30:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:52,864 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2019-01-13 04:30:52,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:30:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2019-01-13 04:30:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:30:52,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:52,873 INFO L402 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] [2019-01-13 04:30:52,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2019-01-13 04:30:52,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:53,228 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-13 04:30:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:53,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:53,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:53,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:53,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:53,238 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 4 states. [2019-01-13 04:30:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:55,073 INFO L93 Difference]: Finished difference Result 18381 states and 60008 transitions. [2019-01-13 04:30:55,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:30:55,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 04:30:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:55,120 INFO L225 Difference]: With dead ends: 18381 [2019-01-13 04:30:55,120 INFO L226 Difference]: Without dead ends: 18381 [2019-01-13 04:30:55,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:30:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2019-01-13 04:30:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 16342. [2019-01-13 04:30:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2019-01-13 04:30:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53833 transitions. [2019-01-13 04:30:55,542 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53833 transitions. Word has length 57 [2019-01-13 04:30:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:55,543 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53833 transitions. [2019-01-13 04:30:55,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:30:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53833 transitions. [2019-01-13 04:30:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:30:55,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:55,556 INFO L402 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] [2019-01-13 04:30:55,556 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash 500419786, now seen corresponding path program 1 times [2019-01-13 04:30:55,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:55,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:55,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:55,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:30:55,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:30:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:30:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:30:55,794 INFO L87 Difference]: Start difference. First operand 16342 states and 53833 transitions. Second operand 5 states. [2019-01-13 04:30:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:55,872 INFO L93 Difference]: Finished difference Result 2850 states and 7542 transitions. [2019-01-13 04:30:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:30:55,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-13 04:30:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:55,876 INFO L225 Difference]: With dead ends: 2850 [2019-01-13 04:30:55,877 INFO L226 Difference]: Without dead ends: 2350 [2019-01-13 04:30:55,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:30:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2019-01-13 04:30:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2243. [2019-01-13 04:30:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-01-13 04:30:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 5917 transitions. [2019-01-13 04:30:55,935 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 5917 transitions. Word has length 57 [2019-01-13 04:30:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:55,935 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 5917 transitions. [2019-01-13 04:30:55,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:30:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 5917 transitions. [2019-01-13 04:30:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:30:55,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:55,949 INFO L402 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] [2019-01-13 04:30:55,949 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2082903995, now seen corresponding path program 1 times [2019-01-13 04:30:55,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:55,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:56,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:56,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:56,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:56,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:56,145 INFO L87 Difference]: Start difference. First operand 2243 states and 5917 transitions. Second operand 4 states. [2019-01-13 04:30:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:56,663 INFO L93 Difference]: Finished difference Result 3291 states and 8297 transitions. [2019-01-13 04:30:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:30:56,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:30:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:56,669 INFO L225 Difference]: With dead ends: 3291 [2019-01-13 04:30:56,670 INFO L226 Difference]: Without dead ends: 3247 [2019-01-13 04:30:56,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:30:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2019-01-13 04:30:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2420. [2019-01-13 04:30:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-13 04:30:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 6262 transitions. [2019-01-13 04:30:56,714 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 6262 transitions. Word has length 90 [2019-01-13 04:30:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:56,714 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 6262 transitions. [2019-01-13 04:30:56,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:30:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 6262 transitions. [2019-01-13 04:30:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:30:56,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:56,722 INFO L402 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] [2019-01-13 04:30:56,722 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:56,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1160220412, now seen corresponding path program 1 times [2019-01-13 04:30:56,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:56,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:57,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:57,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:30:57,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:30:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:30:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:30:57,129 INFO L87 Difference]: Start difference. First operand 2420 states and 6262 transitions. Second operand 7 states. [2019-01-13 04:30:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:57,702 INFO L93 Difference]: Finished difference Result 3423 states and 8594 transitions. [2019-01-13 04:30:57,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:30:57,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-01-13 04:30:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:57,709 INFO L225 Difference]: With dead ends: 3423 [2019-01-13 04:30:57,709 INFO L226 Difference]: Without dead ends: 3362 [2019-01-13 04:30:57,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:30:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-01-13 04:30:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 2524. [2019-01-13 04:30:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-01-13 04:30:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 6500 transitions. [2019-01-13 04:30:57,758 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 6500 transitions. Word has length 90 [2019-01-13 04:30:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:57,758 INFO L480 AbstractCegarLoop]: Abstraction has 2524 states and 6500 transitions. [2019-01-13 04:30:57,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:30:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 6500 transitions. [2019-01-13 04:30:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:30:57,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:57,767 INFO L402 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] [2019-01-13 04:30:57,767 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -849275299, now seen corresponding path program 1 times [2019-01-13 04:30:57,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:57,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:30:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:30:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:30:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:30:58,332 INFO L87 Difference]: Start difference. First operand 2524 states and 6500 transitions. Second operand 7 states. [2019-01-13 04:30:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:58,976 INFO L93 Difference]: Finished difference Result 2884 states and 7321 transitions. [2019-01-13 04:30:58,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:30:58,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-01-13 04:30:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:58,982 INFO L225 Difference]: With dead ends: 2884 [2019-01-13 04:30:58,982 INFO L226 Difference]: Without dead ends: 2884 [2019-01-13 04:30:58,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:30:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2019-01-13 04:30:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2540. [2019-01-13 04:30:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2540 states. [2019-01-13 04:30:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 6534 transitions. [2019-01-13 04:30:59,016 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 6534 transitions. Word has length 90 [2019-01-13 04:30:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:59,017 INFO L480 AbstractCegarLoop]: Abstraction has 2540 states and 6534 transitions. [2019-01-13 04:30:59,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:30:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 6534 transitions. [2019-01-13 04:30:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:30:59,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:59,023 INFO L402 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] [2019-01-13 04:30:59,024 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1951399587, now seen corresponding path program 1 times [2019-01-13 04:30:59,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:59,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:59,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:30:59,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:30:59,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:30:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:30:59,379 INFO L87 Difference]: Start difference. First operand 2540 states and 6534 transitions. Second operand 6 states. [2019-01-13 04:30:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:59,671 INFO L93 Difference]: Finished difference Result 2405 states and 6116 transitions. [2019-01-13 04:30:59,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:30:59,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-01-13 04:30:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:59,676 INFO L225 Difference]: With dead ends: 2405 [2019-01-13 04:30:59,676 INFO L226 Difference]: Without dead ends: 2405 [2019-01-13 04:30:59,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:30:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-01-13 04:30:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2021. [2019-01-13 04:30:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-01-13 04:30:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 5260 transitions. [2019-01-13 04:30:59,708 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 5260 transitions. Word has length 90 [2019-01-13 04:30:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 2021 states and 5260 transitions. [2019-01-13 04:30:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:30:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 5260 transitions. [2019-01-13 04:30:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:30:59,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:59,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:30:59,714 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2107041662, now seen corresponding path program 1 times [2019-01-13 04:30:59,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:59,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:59,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:30:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:59,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:59,974 INFO L87 Difference]: Start difference. First operand 2021 states and 5260 transitions. Second operand 4 states. [2019-01-13 04:31:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:00,438 INFO L93 Difference]: Finished difference Result 2552 states and 6473 transitions. [2019-01-13 04:31:00,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:31:00,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 04:31:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:00,444 INFO L225 Difference]: With dead ends: 2552 [2019-01-13 04:31:00,444 INFO L226 Difference]: Without dead ends: 2552 [2019-01-13 04:31:00,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-01-13 04:31:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2057. [2019-01-13 04:31:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-01-13 04:31:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 5345 transitions. [2019-01-13 04:31:00,471 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 5345 transitions. Word has length 92 [2019-01-13 04:31:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:00,471 INFO L480 AbstractCegarLoop]: Abstraction has 2057 states and 5345 transitions. [2019-01-13 04:31:00,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 5345 transitions. [2019-01-13 04:31:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:00,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:00,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:00,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1438573394, now seen corresponding path program 1 times [2019-01-13 04:31:00,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:00,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:00,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:00,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:00,590 INFO L87 Difference]: Start difference. First operand 2057 states and 5345 transitions. Second operand 4 states. [2019-01-13 04:31:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:00,720 INFO L93 Difference]: Finished difference Result 2393 states and 6265 transitions. [2019-01-13 04:31:00,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:31:00,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 04:31:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:00,725 INFO L225 Difference]: With dead ends: 2393 [2019-01-13 04:31:00,725 INFO L226 Difference]: Without dead ends: 2393 [2019-01-13 04:31:00,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2019-01-13 04:31:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2361. [2019-01-13 04:31:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2019-01-13 04:31:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 6185 transitions. [2019-01-13 04:31:00,755 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 6185 transitions. Word has length 92 [2019-01-13 04:31:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:00,755 INFO L480 AbstractCegarLoop]: Abstraction has 2361 states and 6185 transitions. [2019-01-13 04:31:00,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 6185 transitions. [2019-01-13 04:31:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:00,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:00,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:00,762 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash -638635949, now seen corresponding path program 1 times [2019-01-13 04:31:00,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:00,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:01,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:01,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:31:01,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:31:01,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:31:01,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:01,074 INFO L87 Difference]: Start difference. First operand 2361 states and 6185 transitions. Second operand 8 states. [2019-01-13 04:31:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:01,768 INFO L93 Difference]: Finished difference Result 3770 states and 9710 transitions. [2019-01-13 04:31:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 04:31:01,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-01-13 04:31:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:01,776 INFO L225 Difference]: With dead ends: 3770 [2019-01-13 04:31:01,776 INFO L226 Difference]: Without dead ends: 3738 [2019-01-13 04:31:01,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:31:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-01-13 04:31:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3104. [2019-01-13 04:31:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-01-13 04:31:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 8089 transitions. [2019-01-13 04:31:01,819 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 8089 transitions. Word has length 92 [2019-01-13 04:31:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:01,820 INFO L480 AbstractCegarLoop]: Abstraction has 3104 states and 8089 transitions. [2019-01-13 04:31:01,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:31:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 8089 transitions. [2019-01-13 04:31:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:01,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:01,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:01,827 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash 322978068, now seen corresponding path program 1 times [2019-01-13 04:31:01,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:01,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04: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-01-13 04:31:02,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:02,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:31:02,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:31:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:31:02,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:02,332 INFO L87 Difference]: Start difference. First operand 3104 states and 8089 transitions. Second operand 7 states. [2019-01-13 04:31:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:02,829 INFO L93 Difference]: Finished difference Result 4185 states and 10812 transitions. [2019-01-13 04:31:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:31:02,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:31:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:02,836 INFO L225 Difference]: With dead ends: 4185 [2019-01-13 04:31:02,836 INFO L226 Difference]: Without dead ends: 4185 [2019-01-13 04:31:02,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:31:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2019-01-13 04:31:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 3568. [2019-01-13 04:31:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-01-13 04:31:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 9331 transitions. [2019-01-13 04:31:02,887 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 9331 transitions. Word has length 92 [2019-01-13 04:31:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:02,887 INFO L480 AbstractCegarLoop]: Abstraction has 3568 states and 9331 transitions. [2019-01-13 04:31:02,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:31:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 9331 transitions. [2019-01-13 04:31:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:02,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:02,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:02,894 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1567742549, now seen corresponding path program 1 times [2019-01-13 04:31:02,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:02,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:03,421 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 04:31:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:03,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:03,510 INFO L87 Difference]: Start difference. First operand 3568 states and 9331 transitions. Second operand 5 states. [2019-01-13 04:31:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:03,718 INFO L93 Difference]: Finished difference Result 5384 states and 14252 transitions. [2019-01-13 04:31:03,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:03,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 04:31:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:03,729 INFO L225 Difference]: With dead ends: 5384 [2019-01-13 04:31:03,730 INFO L226 Difference]: Without dead ends: 5384 [2019-01-13 04:31:03,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2019-01-13 04:31:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 3248. [2019-01-13 04:31:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-01-13 04:31:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 8414 transitions. [2019-01-13 04:31:03,799 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 8414 transitions. Word has length 92 [2019-01-13 04:31:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:03,799 INFO L480 AbstractCegarLoop]: Abstraction has 3248 states and 8414 transitions. [2019-01-13 04:31:03,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 8414 transitions. [2019-01-13 04:31:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:03,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:03,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:03,809 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2048458965, now seen corresponding path program 1 times [2019-01-13 04:31:03,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:03,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:03,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:03,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:03,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:04,121 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 04:31:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:04,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:04,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:04,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:04,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:04,161 INFO L87 Difference]: Start difference. First operand 3248 states and 8414 transitions. Second operand 6 states. [2019-01-13 04:31:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:04,401 INFO L93 Difference]: Finished difference Result 2688 states and 6758 transitions. [2019-01-13 04:31:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:31:04,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:31:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:04,407 INFO L225 Difference]: With dead ends: 2688 [2019-01-13 04:31:04,407 INFO L226 Difference]: Without dead ends: 2688 [2019-01-13 04:31:04,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2019-01-13 04:31:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2009. [2019-01-13 04:31:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2019-01-13 04:31:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5175 transitions. [2019-01-13 04:31:04,446 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5175 transitions. Word has length 92 [2019-01-13 04:31:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:04,446 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5175 transitions. [2019-01-13 04:31:04,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5175 transitions. [2019-01-13 04:31:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:04,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:04,452 INFO L402 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-01-13 04:31:04,453 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash -157816760, now seen corresponding path program 1 times [2019-01-13 04:31:04,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:04,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:04,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:04,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:31:04,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:31:04,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:31:04,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:04,965 INFO L87 Difference]: Start difference. First operand 2009 states and 5175 transitions. Second operand 7 states. [2019-01-13 04:31:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:05,603 INFO L93 Difference]: Finished difference Result 3075 states and 7636 transitions. [2019-01-13 04:31:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 04:31:05,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 04:31:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:05,609 INFO L225 Difference]: With dead ends: 3075 [2019-01-13 04:31:05,609 INFO L226 Difference]: Without dead ends: 3075 [2019-01-13 04:31:05,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 04:31:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2019-01-13 04:31:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2309. [2019-01-13 04:31:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2019-01-13 04:31:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 5922 transitions. [2019-01-13 04:31:05,637 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 5922 transitions. Word has length 94 [2019-01-13 04:31:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:05,637 INFO L480 AbstractCegarLoop]: Abstraction has 2309 states and 5922 transitions. [2019-01-13 04:31:05,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:31:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 5922 transitions. [2019-01-13 04:31:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:05,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:05,641 INFO L402 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-01-13 04:31:05,641 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1086947721, now seen corresponding path program 1 times [2019-01-13 04:31:05,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:05,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:05,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:05,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:05,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:05,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:05,911 INFO L87 Difference]: Start difference. First operand 2309 states and 5922 transitions. Second operand 6 states. [2019-01-13 04:31:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:06,109 INFO L93 Difference]: Finished difference Result 2187 states and 5509 transitions. [2019-01-13 04:31:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:31:06,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 04:31:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:06,115 INFO L225 Difference]: With dead ends: 2187 [2019-01-13 04:31:06,115 INFO L226 Difference]: Without dead ends: 2187 [2019-01-13 04:31:06,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:31:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-01-13 04:31:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2007. [2019-01-13 04:31:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-01-13 04:31:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 5151 transitions. [2019-01-13 04:31:06,137 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 5151 transitions. Word has length 94 [2019-01-13 04:31:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:06,137 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 5151 transitions. [2019-01-13 04:31:06,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 5151 transitions. [2019-01-13 04:31:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:06,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:06,140 INFO L402 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-01-13 04:31:06,141 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash 171949001, now seen corresponding path program 1 times [2019-01-13 04:31:06,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:06,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:06,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:06,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:06,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:06,397 INFO L87 Difference]: Start difference. First operand 2007 states and 5151 transitions. Second operand 5 states. [2019-01-13 04:31:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:06,758 INFO L93 Difference]: Finished difference Result 2327 states and 5951 transitions. [2019-01-13 04:31:06,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:31:06,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 04:31:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:06,763 INFO L225 Difference]: With dead ends: 2327 [2019-01-13 04:31:06,763 INFO L226 Difference]: Without dead ends: 2327 [2019-01-13 04:31:06,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-01-13 04:31:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2055. [2019-01-13 04:31:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-01-13 04:31:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5271 transitions. [2019-01-13 04:31:06,787 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5271 transitions. Word has length 94 [2019-01-13 04:31:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:06,787 INFO L480 AbstractCegarLoop]: Abstraction has 2055 states and 5271 transitions. [2019-01-13 04:31:06,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5271 transitions. [2019-01-13 04:31:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:06,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:06,792 INFO L402 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-01-13 04:31:06,792 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1416713482, now seen corresponding path program 1 times [2019-01-13 04:31:06,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:06,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:06,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:07,019 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 04:31:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:07,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:07,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 04:31:07,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 04:31:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 04:31:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:31:07,891 INFO L87 Difference]: Start difference. First operand 2055 states and 5271 transitions. Second operand 12 states. [2019-01-13 04:31:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:08,690 INFO L93 Difference]: Finished difference Result 3825 states and 9938 transitions. [2019-01-13 04:31:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 04:31:08,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-13 04:31:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:08,696 INFO L225 Difference]: With dead ends: 3825 [2019-01-13 04:31:08,696 INFO L226 Difference]: Without dead ends: 2849 [2019-01-13 04:31:08,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:31:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2019-01-13 04:31:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2573. [2019-01-13 04:31:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2019-01-13 04:31:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 6497 transitions. [2019-01-13 04:31:08,735 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 6497 transitions. Word has length 94 [2019-01-13 04:31:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:08,735 INFO L480 AbstractCegarLoop]: Abstraction has 2573 states and 6497 transitions. [2019-01-13 04:31:08,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 04:31:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 6497 transitions. [2019-01-13 04:31:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:08,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:08,741 INFO L402 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-01-13 04:31:08,741 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 962397168, now seen corresponding path program 2 times [2019-01-13 04:31:08,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:08,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:08,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:31:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:31:08,846 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:31:09,022 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:31:09,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:31:09 BasicIcfg [2019-01-13 04:31:09,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:31:09,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:31:09,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:31:09,026 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:31:09,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:30:34" (3/4) ... [2019-01-13 04:31:09,032 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:31:09,231 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:31:09,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:31:09,233 INFO L168 Benchmark]: Toolchain (without parser) took 36710.05 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 947.3 MB in the beginning and 852.3 MB in the end (delta: 95.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-13 04:31:09,234 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:31:09,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:09,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:09,235 INFO L168 Benchmark]: Boogie Preprocessor took 48.50 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-01-13 04:31:09,235 INFO L168 Benchmark]: RCFGBuilder took 1220.67 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:09,235 INFO L168 Benchmark]: TraceAbstraction took 34403.61 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 903.6 MB in the end (delta: 157.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-13 04:31:09,238 INFO L168 Benchmark]: Witness Printer took 205.85 ms. Allocated memory is still 2.3 GB. Free memory was 903.6 MB in the beginning and 852.3 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:09,241 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 751.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.50 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 1220.67 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34403.61 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 903.6 MB in the end (delta: 157.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 205.85 ms. Allocated memory is still 2.3 GB. Free memory was 903.6 MB in the beginning and 852.3 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2011; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2012; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L776] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L778] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 34.2s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4425 SDtfs, 4005 SDslu, 10260 SDs, 0 SdLazy, 4033 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 59260 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1672 NumberOfCodeBlocks, 1672 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1558 ConstructedInterpolants, 0 QuantifiedInterpolants, 358136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...