./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/mix038_tso.opt_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 42fa54ef19bc7b6faea6281eff260004759e02fd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 20:56:12,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:56:12,847 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:56:12,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:56:12,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:56:12,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:56:12,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:56:12,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:56:12,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:56:12,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:56:12,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:56:12,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:56:12,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:56:12,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:56:12,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:56:12,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:56:12,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:56:12,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:56:12,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:56:12,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:56:12,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:56:12,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:56:12,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:56:12,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:56:12,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:56:12,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:56:12,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:56:12,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:56:12,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:56:12,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:56:12,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:56:12,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:56:12,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:56:12,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:56:12,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:56:12,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:56:12,939 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:56:12,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:56:12,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:56:12,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:56:12,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:56:12,970 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:56:12,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:56:12,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:56:12,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:56:12,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:56:12,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:56:12,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:56:12,977 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:56:12,977 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:56:12,977 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:56:12,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:56:12,978 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:56:12,978 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:56:12,979 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:56:12,979 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:56:12,979 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:56:12,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:56:12,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:56:12,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:56:12,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:56:12,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:56:12,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:56:12,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:56:12,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:56:12,980 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 -> 42fa54ef19bc7b6faea6281eff260004759e02fd [2018-12-31 20:56:13,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:56:13,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:56:13,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:56:13,082 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:56:13,082 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:56:13,083 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i [2018-12-31 20:56:13,155 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617d53afe/dda3eb022d9f45968c59d53754d4f5fb/FLAG060875999 [2018-12-31 20:56:13,690 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:56:13,691 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i [2018-12-31 20:56:13,708 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617d53afe/dda3eb022d9f45968c59d53754d4f5fb/FLAG060875999 [2018-12-31 20:56:13,963 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617d53afe/dda3eb022d9f45968c59d53754d4f5fb [2018-12-31 20:56:13,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:56:13,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:56:13,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:56:13,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:56:13,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:56:13,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:56:13" (1/1) ... [2018-12-31 20:56:13,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729def0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:13, skipping insertion in model container [2018-12-31 20:56:13,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:56:13" (1/1) ... [2018-12-31 20:56:13,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:56:14,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:56:14,533 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:56:14,556 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:56:14,729 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:56:14,817 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:56:14,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14 WrapperNode [2018-12-31 20:56:14,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:56:14,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:56:14,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:56:14,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:56:14,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:56:14,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:56:14,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:56:14,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:56:14,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (1/1) ... [2018-12-31 20:56:14,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:56:14,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:56:14,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:56:14,956 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:56:14,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (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 [2018-12-31 20:56:15,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:56:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:56:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:56:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:56:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:56:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:56:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:56:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:56:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 20:56:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 20:56:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:56:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:56:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:56:15,042 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 20:56:16,385 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:56:16,385 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:56:16,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:56:16 BoogieIcfgContainer [2018-12-31 20:56:16,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:56:16,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:56:16,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:56:16,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:56:16,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:56:13" (1/3) ... [2018-12-31 20:56:16,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749c34c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:56:16, skipping insertion in model container [2018-12-31 20:56:16,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:56:14" (2/3) ... [2018-12-31 20:56:16,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749c34c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:56:16, skipping insertion in model container [2018-12-31 20:56:16,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:56:16" (3/3) ... [2018-12-31 20:56:16,395 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.opt_false-unreach-call.i [2018-12-31 20:56:16,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,451 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,451 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,454 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,455 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,484 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,492 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,492 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,492 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,493 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,493 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,504 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:56:16,543 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:56:16,544 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:56:16,553 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:56:16,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:56:16,600 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:56:16,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:56:16,601 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:56:16,602 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:56:16,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:56:16,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:56:16,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:56:16,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:56:16,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:56:16,618 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-12-31 20:56:49,847 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-12-31 20:56:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-12-31 20:56:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 20:56:49,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:56:49,870 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] [2018-12-31 20:56:49,874 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:56:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:56:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-12-31 20:56:49,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:56:49,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:56:49,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:56:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:56:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:56:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:56:50,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:56:50,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:56:50,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:56:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:56:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:56:50,294 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-12-31 20:56:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:56:58,880 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-12-31 20:56:58,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:56:58,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 20:56:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:00,281 INFO L225 Difference]: With dead ends: 257065 [2018-12-31 20:57:00,281 INFO L226 Difference]: Without dead ends: 174815 [2018-12-31 20:57:00,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:57:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-12-31 20:57:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-12-31 20:57:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-12-31 20:57:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-12-31 20:57:07,318 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-12-31 20:57:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:07,319 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-12-31 20:57:07,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:57:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-12-31 20:57:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:57:07,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:07,344 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] [2018-12-31 20:57:07,345 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-12-31 20:57:07,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:07,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:07,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:07,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:07,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:07,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:57:07,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:57:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:57:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:57:07,471 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 4 states. [2018-12-31 20:57:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:08,414 INFO L93 Difference]: Finished difference Result 99453 states and 448690 transitions. [2018-12-31 20:57:08,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:57:08,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 20:57:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:09,040 INFO L225 Difference]: With dead ends: 99453 [2018-12-31 20:57:09,040 INFO L226 Difference]: Without dead ends: 95223 [2018-12-31 20:57:09,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:57:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95223 states. [2018-12-31 20:57:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95223 to 95223. [2018-12-31 20:57:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95223 states. [2018-12-31 20:57:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95223 states to 95223 states and 433074 transitions. [2018-12-31 20:57:19,585 INFO L78 Accepts]: Start accepts. Automaton has 95223 states and 433074 transitions. Word has length 54 [2018-12-31 20:57:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:19,586 INFO L480 AbstractCegarLoop]: Abstraction has 95223 states and 433074 transitions. [2018-12-31 20:57:19,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:57:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 95223 states and 433074 transitions. [2018-12-31 20:57:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 20:57:19,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:19,602 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] [2018-12-31 20:57:19,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1834718252, now seen corresponding path program 1 times [2018-12-31 20:57:19,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:19,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:19,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:19,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:57:19,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:57:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:57:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:57:19,817 INFO L87 Difference]: Start difference. First operand 95223 states and 433074 transitions. Second operand 5 states. [2018-12-31 20:57:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:20,386 INFO L93 Difference]: Finished difference Result 30967 states and 124170 transitions. [2018-12-31 20:57:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:57:20,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-31 20:57:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:20,459 INFO L225 Difference]: With dead ends: 30967 [2018-12-31 20:57:20,459 INFO L226 Difference]: Without dead ends: 27339 [2018-12-31 20:57:20,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-31 20:57:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 26879. [2018-12-31 20:57:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26879 states. [2018-12-31 20:57:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26879 states to 26879 states and 107652 transitions. [2018-12-31 20:57:21,035 INFO L78 Accepts]: Start accepts. Automaton has 26879 states and 107652 transitions. Word has length 55 [2018-12-31 20:57:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:21,035 INFO L480 AbstractCegarLoop]: Abstraction has 26879 states and 107652 transitions. [2018-12-31 20:57:21,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:57:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 26879 states and 107652 transitions. [2018-12-31 20:57:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 20:57:21,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:21,040 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] [2018-12-31 20:57:21,040 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash 901134090, now seen corresponding path program 1 times [2018-12-31 20:57:21,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:21,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:21,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:21,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:21,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:57:21,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:57:21,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:57:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:21,262 INFO L87 Difference]: Start difference. First operand 26879 states and 107652 transitions. Second operand 6 states. [2018-12-31 20:57:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:22,329 INFO L93 Difference]: Finished difference Result 37431 states and 146189 transitions. [2018-12-31 20:57:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:57:22,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-31 20:57:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:22,433 INFO L225 Difference]: With dead ends: 37431 [2018-12-31 20:57:22,434 INFO L226 Difference]: Without dead ends: 37056 [2018-12-31 20:57:22,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:57:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37056 states. [2018-12-31 20:57:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37056 to 35272. [2018-12-31 20:57:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35272 states. [2018-12-31 20:57:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35272 states to 35272 states and 138747 transitions. [2018-12-31 20:57:23,326 INFO L78 Accepts]: Start accepts. Automaton has 35272 states and 138747 transitions. Word has length 55 [2018-12-31 20:57:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:23,326 INFO L480 AbstractCegarLoop]: Abstraction has 35272 states and 138747 transitions. [2018-12-31 20:57:23,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:57:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 35272 states and 138747 transitions. [2018-12-31 20:57:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 20:57:23,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:23,333 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] [2018-12-31 20:57:23,333 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -710959504, now seen corresponding path program 1 times [2018-12-31 20:57:23,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:23,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:23,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:57:23,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:57:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:57:23,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:57:23,421 INFO L87 Difference]: Start difference. First operand 35272 states and 138747 transitions. Second operand 3 states. [2018-12-31 20:57:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:23,806 INFO L93 Difference]: Finished difference Result 46812 states and 182039 transitions. [2018-12-31 20:57:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:57:23,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-31 20:57:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:23,936 INFO L225 Difference]: With dead ends: 46812 [2018-12-31 20:57:23,936 INFO L226 Difference]: Without dead ends: 46792 [2018-12-31 20:57:23,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:57:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46792 states. [2018-12-31 20:57:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46792 to 36254. [2018-12-31 20:57:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36254 states. [2018-12-31 20:57:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36254 states to 36254 states and 141454 transitions. [2018-12-31 20:57:24,771 INFO L78 Accepts]: Start accepts. Automaton has 36254 states and 141454 transitions. Word has length 57 [2018-12-31 20:57:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:24,772 INFO L480 AbstractCegarLoop]: Abstraction has 36254 states and 141454 transitions. [2018-12-31 20:57:24,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:57:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36254 states and 141454 transitions. [2018-12-31 20:57:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 20:57:24,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:24,779 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] [2018-12-31 20:57:24,779 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:24,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-12-31 20:57:24,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:24,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:24,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:24,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:24,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:24,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:24,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:57:24,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:57:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:57:24,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:24,972 INFO L87 Difference]: Start difference. First operand 36254 states and 141454 transitions. Second operand 6 states. [2018-12-31 20:57:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:26,168 INFO L93 Difference]: Finished difference Result 50346 states and 193876 transitions. [2018-12-31 20:57:26,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:57:26,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 20:57:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:26,301 INFO L225 Difference]: With dead ends: 50346 [2018-12-31 20:57:26,301 INFO L226 Difference]: Without dead ends: 49861 [2018-12-31 20:57:26,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:57:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49861 states. [2018-12-31 20:57:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49861 to 39288. [2018-12-31 20:57:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39288 states. [2018-12-31 20:57:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39288 states to 39288 states and 153275 transitions. [2018-12-31 20:57:28,076 INFO L78 Accepts]: Start accepts. Automaton has 39288 states and 153275 transitions. Word has length 61 [2018-12-31 20:57:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:28,077 INFO L480 AbstractCegarLoop]: Abstraction has 39288 states and 153275 transitions. [2018-12-31 20:57:28,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:57:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 39288 states and 153275 transitions. [2018-12-31 20:57:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 20:57:28,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:28,102 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] [2018-12-31 20:57:28,103 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash -34559289, now seen corresponding path program 1 times [2018-12-31 20:57:28,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:28,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:28,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:28,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:28,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:57:28,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:57:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:57:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:57:28,215 INFO L87 Difference]: Start difference. First operand 39288 states and 153275 transitions. Second operand 4 states. [2018-12-31 20:57:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:28,760 INFO L93 Difference]: Finished difference Result 46151 states and 179278 transitions. [2018-12-31 20:57:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:57:28,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-31 20:57:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:28,894 INFO L225 Difference]: With dead ends: 46151 [2018-12-31 20:57:28,894 INFO L226 Difference]: Without dead ends: 46151 [2018-12-31 20:57:28,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:57:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46151 states. [2018-12-31 20:57:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46151 to 42183. [2018-12-31 20:57:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42183 states. [2018-12-31 20:57:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42183 states to 42183 states and 164110 transitions. [2018-12-31 20:57:29,795 INFO L78 Accepts]: Start accepts. Automaton has 42183 states and 164110 transitions. Word has length 72 [2018-12-31 20:57:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:29,795 INFO L480 AbstractCegarLoop]: Abstraction has 42183 states and 164110 transitions. [2018-12-31 20:57:29,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:57:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 42183 states and 164110 transitions. [2018-12-31 20:57:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 20:57:29,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:29,827 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] [2018-12-31 20:57:29,827 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1708251046, now seen corresponding path program 1 times [2018-12-31 20:57:29,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:29,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:29,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:29,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:29,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:30,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:57:30,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:57:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:57:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:30,063 INFO L87 Difference]: Start difference. First operand 42183 states and 164110 transitions. Second operand 6 states. [2018-12-31 20:57:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:30,224 INFO L93 Difference]: Finished difference Result 13863 states and 46334 transitions. [2018-12-31 20:57:30,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:57:30,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-31 20:57:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:30,248 INFO L225 Difference]: With dead ends: 13863 [2018-12-31 20:57:30,249 INFO L226 Difference]: Without dead ends: 11607 [2018-12-31 20:57:30,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:57:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11607 states. [2018-12-31 20:57:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11607 to 11017. [2018-12-31 20:57:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11017 states. [2018-12-31 20:57:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11017 states to 11017 states and 36286 transitions. [2018-12-31 20:57:30,415 INFO L78 Accepts]: Start accepts. Automaton has 11017 states and 36286 transitions. Word has length 72 [2018-12-31 20:57:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:30,415 INFO L480 AbstractCegarLoop]: Abstraction has 11017 states and 36286 transitions. [2018-12-31 20:57:30,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:57:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 11017 states and 36286 transitions. [2018-12-31 20:57:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:30,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:30,434 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] [2018-12-31 20:57:30,435 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1077570827, now seen corresponding path program 1 times [2018-12-31 20:57:30,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:30,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:30,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:30,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:57:30,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:57:30,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:57:30,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:57:30,599 INFO L87 Difference]: Start difference. First operand 11017 states and 36286 transitions. Second operand 4 states. [2018-12-31 20:57:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:30,806 INFO L93 Difference]: Finished difference Result 12233 states and 40430 transitions. [2018-12-31 20:57:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:57:30,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 20:57:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:30,830 INFO L225 Difference]: With dead ends: 12233 [2018-12-31 20:57:30,831 INFO L226 Difference]: Without dead ends: 12233 [2018-12-31 20:57:30,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:57:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2018-12-31 20:57:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11401. [2018-12-31 20:57:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2018-12-31 20:57:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 37662 transitions. [2018-12-31 20:57:31,015 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 37662 transitions. Word has length 91 [2018-12-31 20:57:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:31,015 INFO L480 AbstractCegarLoop]: Abstraction has 11401 states and 37662 transitions. [2018-12-31 20:57:31,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:57:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 37662 transitions. [2018-12-31 20:57:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:31,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:31,037 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] [2018-12-31 20:57:31,037 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1409942006, now seen corresponding path program 1 times [2018-12-31 20:57:31,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:31,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:31,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:31,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:31,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:31,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:57:31,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:57:31,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:57:31,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:57:31,174 INFO L87 Difference]: Start difference. First operand 11401 states and 37662 transitions. Second operand 4 states. [2018-12-31 20:57:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:31,499 INFO L93 Difference]: Finished difference Result 15846 states and 51308 transitions. [2018-12-31 20:57:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:57:31,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 20:57:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:31,531 INFO L225 Difference]: With dead ends: 15846 [2018-12-31 20:57:31,531 INFO L226 Difference]: Without dead ends: 15846 [2018-12-31 20:57:31,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:57:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15846 states. [2018-12-31 20:57:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15846 to 13863. [2018-12-31 20:57:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13863 states. [2018-12-31 20:57:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13863 states to 13863 states and 45161 transitions. [2018-12-31 20:57:31,782 INFO L78 Accepts]: Start accepts. Automaton has 13863 states and 45161 transitions. Word has length 91 [2018-12-31 20:57:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:31,782 INFO L480 AbstractCegarLoop]: Abstraction has 13863 states and 45161 transitions. [2018-12-31 20:57:31,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:57:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13863 states and 45161 transitions. [2018-12-31 20:57:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:31,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:31,807 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] [2018-12-31 20:57:31,808 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:31,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1159544393, now seen corresponding path program 1 times [2018-12-31 20:57:31,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:31,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:32,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:32,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:57:32,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:57:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:57:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:32,129 INFO L87 Difference]: Start difference. First operand 13863 states and 45161 transitions. Second operand 6 states. [2018-12-31 20:57:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:32,884 INFO L93 Difference]: Finished difference Result 18373 states and 59254 transitions. [2018-12-31 20:57:32,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:57:32,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-31 20:57:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:32,920 INFO L225 Difference]: With dead ends: 18373 [2018-12-31 20:57:32,920 INFO L226 Difference]: Without dead ends: 17938 [2018-12-31 20:57:32,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17938 states. [2018-12-31 20:57:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17938 to 17023. [2018-12-31 20:57:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17023 states. [2018-12-31 20:57:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17023 states to 17023 states and 55254 transitions. [2018-12-31 20:57:33,206 INFO L78 Accepts]: Start accepts. Automaton has 17023 states and 55254 transitions. Word has length 91 [2018-12-31 20:57:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:33,206 INFO L480 AbstractCegarLoop]: Abstraction has 17023 states and 55254 transitions. [2018-12-31 20:57:33,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:57:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17023 states and 55254 transitions. [2018-12-31 20:57:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:33,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:33,232 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] [2018-12-31 20:57:33,233 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1395330258, now seen corresponding path program 2 times [2018-12-31 20:57:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:33,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:33,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:33,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:57:33,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:57:33,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:57:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:33,428 INFO L87 Difference]: Start difference. First operand 17023 states and 55254 transitions. Second operand 7 states. [2018-12-31 20:57:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:34,271 INFO L93 Difference]: Finished difference Result 21756 states and 70736 transitions. [2018-12-31 20:57:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:57:34,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-31 20:57:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:34,315 INFO L225 Difference]: With dead ends: 21756 [2018-12-31 20:57:34,315 INFO L226 Difference]: Without dead ends: 21756 [2018-12-31 20:57:34,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21756 states. [2018-12-31 20:57:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21756 to 17853. [2018-12-31 20:57:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17853 states. [2018-12-31 20:57:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17853 states to 17853 states and 58333 transitions. [2018-12-31 20:57:34,668 INFO L78 Accepts]: Start accepts. Automaton has 17853 states and 58333 transitions. Word has length 91 [2018-12-31 20:57:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:34,668 INFO L480 AbstractCegarLoop]: Abstraction has 17853 states and 58333 transitions. [2018-12-31 20:57:34,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:57:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17853 states and 58333 transitions. [2018-12-31 20:57:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:34,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:34,701 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] [2018-12-31 20:57:34,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -829778632, now seen corresponding path program 1 times [2018-12-31 20:57:34,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:34,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:34,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:34,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:57:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:35,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:35,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:57:35,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:57:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:57:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:57:35,153 INFO L87 Difference]: Start difference. First operand 17853 states and 58333 transitions. Second operand 5 states. [2018-12-31 20:57:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:35,796 INFO L93 Difference]: Finished difference Result 21835 states and 70443 transitions. [2018-12-31 20:57:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:57:35,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-31 20:57:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:35,839 INFO L225 Difference]: With dead ends: 21835 [2018-12-31 20:57:35,839 INFO L226 Difference]: Without dead ends: 21715 [2018-12-31 20:57:35,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:57:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21715 states. [2018-12-31 20:57:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21715 to 18388. [2018-12-31 20:57:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18388 states. [2018-12-31 20:57:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18388 states to 18388 states and 59886 transitions. [2018-12-31 20:57:36,616 INFO L78 Accepts]: Start accepts. Automaton has 18388 states and 59886 transitions. Word has length 91 [2018-12-31 20:57:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:36,617 INFO L480 AbstractCegarLoop]: Abstraction has 18388 states and 59886 transitions. [2018-12-31 20:57:36,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:57:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18388 states and 59886 transitions. [2018-12-31 20:57:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:36,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:36,652 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] [2018-12-31 20:57:36,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1233112668, now seen corresponding path program 3 times [2018-12-31 20:57:36,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:37,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:37,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:57:37,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:57:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:57:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:37,300 INFO L87 Difference]: Start difference. First operand 18388 states and 59886 transitions. Second operand 7 states. [2018-12-31 20:57:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:38,288 INFO L93 Difference]: Finished difference Result 33624 states and 109666 transitions. [2018-12-31 20:57:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 20:57:38,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-31 20:57:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:38,350 INFO L225 Difference]: With dead ends: 33624 [2018-12-31 20:57:38,350 INFO L226 Difference]: Without dead ends: 33624 [2018-12-31 20:57:38,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-31 20:57:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33624 states. [2018-12-31 20:57:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33624 to 20931. [2018-12-31 20:57:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20931 states. [2018-12-31 20:57:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20931 states to 20931 states and 68543 transitions. [2018-12-31 20:57:38,764 INFO L78 Accepts]: Start accepts. Automaton has 20931 states and 68543 transitions. Word has length 91 [2018-12-31 20:57:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:38,765 INFO L480 AbstractCegarLoop]: Abstraction has 20931 states and 68543 transitions. [2018-12-31 20:57:38,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:57:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20931 states and 68543 transitions. [2018-12-31 20:57:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:38,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:38,805 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] [2018-12-31 20:57:38,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2120616349, now seen corresponding path program 1 times [2018-12-31 20:57:38,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:38,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:38,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:57:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:39,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:39,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:57:39,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:57:39,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:57:39,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:39,128 INFO L87 Difference]: Start difference. First operand 20931 states and 68543 transitions. Second operand 6 states. [2018-12-31 20:57:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:39,266 INFO L93 Difference]: Finished difference Result 25006 states and 80653 transitions. [2018-12-31 20:57:39,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:57:39,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-31 20:57:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:39,314 INFO L225 Difference]: With dead ends: 25006 [2018-12-31 20:57:39,314 INFO L226 Difference]: Without dead ends: 25006 [2018-12-31 20:57:39,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25006 states. [2018-12-31 20:57:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25006 to 19344. [2018-12-31 20:57:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19344 states. [2018-12-31 20:57:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19344 states to 19344 states and 62285 transitions. [2018-12-31 20:57:39,671 INFO L78 Accepts]: Start accepts. Automaton has 19344 states and 62285 transitions. Word has length 91 [2018-12-31 20:57:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:39,672 INFO L480 AbstractCegarLoop]: Abstraction has 19344 states and 62285 transitions. [2018-12-31 20:57:39,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:57:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 19344 states and 62285 transitions. [2018-12-31 20:57:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 20:57:39,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:39,702 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] [2018-12-31 20:57:39,702 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash -844096675, now seen corresponding path program 1 times [2018-12-31 20:57:39,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:39,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:39,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:39,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:39,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:39,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:39,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:57:39,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:57:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:57:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:39,992 INFO L87 Difference]: Start difference. First operand 19344 states and 62285 transitions. Second operand 6 states. [2018-12-31 20:57:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:40,261 INFO L93 Difference]: Finished difference Result 18448 states and 58669 transitions. [2018-12-31 20:57:40,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:57:40,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-31 20:57:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:40,296 INFO L225 Difference]: With dead ends: 18448 [2018-12-31 20:57:40,297 INFO L226 Difference]: Without dead ends: 18448 [2018-12-31 20:57:40,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:57:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18448 states. [2018-12-31 20:57:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18448 to 15746. [2018-12-31 20:57:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15746 states. [2018-12-31 20:57:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15746 states to 15746 states and 50467 transitions. [2018-12-31 20:57:40,551 INFO L78 Accepts]: Start accepts. Automaton has 15746 states and 50467 transitions. Word has length 91 [2018-12-31 20:57:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:40,551 INFO L480 AbstractCegarLoop]: Abstraction has 15746 states and 50467 transitions. [2018-12-31 20:57:40,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:57:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 15746 states and 50467 transitions. [2018-12-31 20:57:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:40,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:40,574 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] [2018-12-31 20:57:40,574 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:40,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash -75405535, now seen corresponding path program 1 times [2018-12-31 20:57:40,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:40,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:40,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:40,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:40,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:57:40,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:57:40,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:57:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:40,812 INFO L87 Difference]: Start difference. First operand 15746 states and 50467 transitions. Second operand 7 states. [2018-12-31 20:57:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:41,337 INFO L93 Difference]: Finished difference Result 17176 states and 54411 transitions. [2018-12-31 20:57:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:57:41,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 20:57:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:41,370 INFO L225 Difference]: With dead ends: 17176 [2018-12-31 20:57:41,371 INFO L226 Difference]: Without dead ends: 17176 [2018-12-31 20:57:41,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-31 20:57:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17176 states. [2018-12-31 20:57:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17176 to 13776. [2018-12-31 20:57:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13776 states. [2018-12-31 20:57:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13776 states to 13776 states and 43531 transitions. [2018-12-31 20:57:41,602 INFO L78 Accepts]: Start accepts. Automaton has 13776 states and 43531 transitions. Word has length 93 [2018-12-31 20:57:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:41,602 INFO L480 AbstractCegarLoop]: Abstraction has 13776 states and 43531 transitions. [2018-12-31 20:57:41,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:57:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13776 states and 43531 transitions. [2018-12-31 20:57:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:41,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:41,623 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] [2018-12-31 20:57:41,623 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:41,624 INFO L82 PathProgramCache]: Analyzing trace with hash 886208482, now seen corresponding path program 1 times [2018-12-31 20:57:41,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:41,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:41,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:42,151 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 20:57:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:42,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:42,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:57:42,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:57:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:57:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:57:42,232 INFO L87 Difference]: Start difference. First operand 13776 states and 43531 transitions. Second operand 5 states. [2018-12-31 20:57:42,623 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 20:57:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:42,724 INFO L93 Difference]: Finished difference Result 13776 states and 43467 transitions. [2018-12-31 20:57:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:57:42,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 20:57:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:42,759 INFO L225 Difference]: With dead ends: 13776 [2018-12-31 20:57:42,760 INFO L226 Difference]: Without dead ends: 13776 [2018-12-31 20:57:42,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:57:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13776 states. [2018-12-31 20:57:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13776 to 13776. [2018-12-31 20:57:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13776 states. [2018-12-31 20:57:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13776 states to 13776 states and 43467 transitions. [2018-12-31 20:57:42,985 INFO L78 Accepts]: Start accepts. Automaton has 13776 states and 43467 transitions. Word has length 93 [2018-12-31 20:57:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:42,986 INFO L480 AbstractCegarLoop]: Abstraction has 13776 states and 43467 transitions. [2018-12-31 20:57:42,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:57:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 13776 states and 43467 transitions. [2018-12-31 20:57:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:43,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:43,002 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] [2018-12-31 20:57:43,003 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:43,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1773712163, now seen corresponding path program 1 times [2018-12-31 20:57:43,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:43,312 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:57:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:43,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:43,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:57:43,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:57:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:57:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:57:43,424 INFO L87 Difference]: Start difference. First operand 13776 states and 43467 transitions. Second operand 10 states. [2018-12-31 20:57:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:45,513 INFO L93 Difference]: Finished difference Result 25189 states and 79346 transitions. [2018-12-31 20:57:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:57:45,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-31 20:57:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:45,548 INFO L225 Difference]: With dead ends: 25189 [2018-12-31 20:57:45,548 INFO L226 Difference]: Without dead ends: 17756 [2018-12-31 20:57:45,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-31 20:57:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17756 states. [2018-12-31 20:57:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17756 to 14686. [2018-12-31 20:57:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14686 states. [2018-12-31 20:57:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14686 states to 14686 states and 46090 transitions. [2018-12-31 20:57:45,781 INFO L78 Accepts]: Start accepts. Automaton has 14686 states and 46090 transitions. Word has length 93 [2018-12-31 20:57:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:45,782 INFO L480 AbstractCegarLoop]: Abstraction has 14686 states and 46090 transitions. [2018-12-31 20:57:45,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:57:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 14686 states and 46090 transitions. [2018-12-31 20:57:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:45,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:45,801 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] [2018-12-31 20:57:45,801 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash 530462971, now seen corresponding path program 2 times [2018-12-31 20:57:45,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:45,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:45,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:45,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:57:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:46,100 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 20:57:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:46,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:46,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:57:46,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:57:46,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:57:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:57:46,751 INFO L87 Difference]: Start difference. First operand 14686 states and 46090 transitions. Second operand 10 states. [2018-12-31 20:57:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:47,832 INFO L93 Difference]: Finished difference Result 27674 states and 86999 transitions. [2018-12-31 20:57:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:57:47,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-31 20:57:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:47,858 INFO L225 Difference]: With dead ends: 27674 [2018-12-31 20:57:47,859 INFO L226 Difference]: Without dead ends: 12746 [2018-12-31 20:57:47,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:57:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12746 states. [2018-12-31 20:57:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12746 to 12746. [2018-12-31 20:57:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12746 states. [2018-12-31 20:57:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12746 states to 12746 states and 39862 transitions. [2018-12-31 20:57:48,059 INFO L78 Accepts]: Start accepts. Automaton has 12746 states and 39862 transitions. Word has length 93 [2018-12-31 20:57:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:48,060 INFO L480 AbstractCegarLoop]: Abstraction has 12746 states and 39862 transitions. [2018-12-31 20:57:48,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:57:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12746 states and 39862 transitions. [2018-12-31 20:57:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:48,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:48,080 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] [2018-12-31 20:57:48,080 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1667491465, now seen corresponding path program 3 times [2018-12-31 20:57:48,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:48,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:57:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:48,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:48,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:57:48,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:57:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:57:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:57:48,375 INFO L87 Difference]: Start difference. First operand 12746 states and 39862 transitions. Second operand 7 states. [2018-12-31 20:57:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:49,144 INFO L93 Difference]: Finished difference Result 22195 states and 69714 transitions. [2018-12-31 20:57:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:57:49,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 20:57:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:49,162 INFO L225 Difference]: With dead ends: 22195 [2018-12-31 20:57:49,162 INFO L226 Difference]: Without dead ends: 8461 [2018-12-31 20:57:49,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:57:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8461 states. [2018-12-31 20:57:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8461 to 8461. [2018-12-31 20:57:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2018-12-31 20:57:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 26511 transitions. [2018-12-31 20:57:49,291 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 26511 transitions. Word has length 93 [2018-12-31 20:57:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:49,291 INFO L480 AbstractCegarLoop]: Abstraction has 8461 states and 26511 transitions. [2018-12-31 20:57:49,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:57:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 26511 transitions. [2018-12-31 20:57:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:49,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:49,302 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] [2018-12-31 20:57:49,303 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1773849445, now seen corresponding path program 4 times [2018-12-31 20:57:49,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:49,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:49,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:57:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:57:49,557 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:57:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:57:49,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:57:49,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:57:49,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:57:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:57:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:57:49,746 INFO L87 Difference]: Start difference. First operand 8461 states and 26511 transitions. Second operand 11 states. [2018-12-31 20:57:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:57:52,315 INFO L93 Difference]: Finished difference Result 14700 states and 45647 transitions. [2018-12-31 20:57:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:57:52,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-12-31 20:57:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:57:52,339 INFO L225 Difference]: With dead ends: 14700 [2018-12-31 20:57:52,339 INFO L226 Difference]: Without dead ends: 9426 [2018-12-31 20:57:52,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:57:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9426 states. [2018-12-31 20:57:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9426 to 8470. [2018-12-31 20:57:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8470 states. [2018-12-31 20:57:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8470 states to 8470 states and 26522 transitions. [2018-12-31 20:57:52,495 INFO L78 Accepts]: Start accepts. Automaton has 8470 states and 26522 transitions. Word has length 93 [2018-12-31 20:57:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:57:52,495 INFO L480 AbstractCegarLoop]: Abstraction has 8470 states and 26522 transitions. [2018-12-31 20:57:52,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:57:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8470 states and 26522 transitions. [2018-12-31 20:57:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 20:57:52,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:57:52,508 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] [2018-12-31 20:57:52,508 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:57:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:57:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2023471655, now seen corresponding path program 5 times [2018-12-31 20:57:52,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:57:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:57:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:52,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:57:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:57:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:57:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:57:52,610 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:57:52,842 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:57:52,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:57:52 BasicIcfg [2018-12-31 20:57:52,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:57:52,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:57:52,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:57:52,845 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:57:52,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:56:16" (3/4) ... [2018-12-31 20:57:52,849 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:57:53,069 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:57:53,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:57:53,075 INFO L168 Benchmark]: Toolchain (without parser) took 99107.23 ms. Allocated memory was 1.0 GB in the beginning and 5.7 GB in the end (delta: 4.7 GB). Free memory was 946.0 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-31 20:57:53,076 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-12-31 20:57:53,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -107.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-31 20:57:53,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:57:53,077 INFO L168 Benchmark]: Boogie Preprocessor took 69.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:57:53,077 INFO L168 Benchmark]: RCFGBuilder took 1430.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-31 20:57:53,077 INFO L168 Benchmark]: TraceAbstraction took 96457.47 ms. Allocated memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-31 20:57:53,078 INFO L168 Benchmark]: Witness Printer took 228.44 ms. Allocated memory is still 5.7 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:57:53,080 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.17 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 848.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -107.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1430.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96457.47 ms. Allocated memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 228.44 ms. Allocated memory is still 5.7 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L796] -1 pthread_t t1024; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L797] FCALL, FORK -1 pthread_create(&t1024, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L798] -1 pthread_t t1025; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L799] FCALL, FORK -1 pthread_create(&t1025, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L800] -1 pthread_t t1026; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L801] FCALL, FORK -1 pthread_create(&t1026, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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 [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -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 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 219 locations, 3 error locations. UNSAFE Result, 96.2s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 28.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5801 SDtfs, 7436 SDslu, 16367 SDs, 0 SdLazy, 5533 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149045occurred in iteration=0, 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: 26.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 131616 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1851 NumberOfCodeBlocks, 1851 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 362674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...