./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_tso.oepc_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/mix031_tso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bedc30426f84517809c1aba2f717b94ba4147624 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:00,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:28:00,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:28:00,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:28:00,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:28:00,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:28:00,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:28:00,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:28:00,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:28:00,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:28:00,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:28:00,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:28:01,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:28:01,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:28:01,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:28:01,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:28:01,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:28:01,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:28:01,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:28:01,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:28:01,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:28:01,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:28:01,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:28:01,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:28:01,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:28:01,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:28:01,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:28:01,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:28:01,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:28:01,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:28:01,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:28:01,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:28:01,024 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:28:01,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:28:01,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:28:01,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:28:01,027 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:28:01,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:28:01,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:28:01,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:28:01,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:28:01,045 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:28:01,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:28:01,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:28:01,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:28:01,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:28:01,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:28:01,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:28:01,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:28:01,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:28:01,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:28:01,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:28:01,049 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:28:01,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:28:01,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:28:01,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:28:01,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:28:01,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:28:01,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:28:01,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:28:01,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:28:01,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:28:01,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:28:01,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:28:01,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:28:01,052 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 -> bedc30426f84517809c1aba2f717b94ba4147624 [2018-12-31 20:28:01,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:28:01,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:28:01,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:28:01,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:28:01,112 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:28:01,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2018-12-31 20:28:01,177 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ee62e5/a5c7b46f93cf429ebf2350d7f035c15e/FLAG0a0f02ae3 [2018-12-31 20:28:01,782 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:28:01,783 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2018-12-31 20:28:01,809 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ee62e5/a5c7b46f93cf429ebf2350d7f035c15e/FLAG0a0f02ae3 [2018-12-31 20:28:01,970 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ee62e5/a5c7b46f93cf429ebf2350d7f035c15e [2018-12-31 20:28:01,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:28:01,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:28:01,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:28:01,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:28:01,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:28:01,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:28:01" (1/1) ... [2018-12-31 20:28:01,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488d0b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:01, skipping insertion in model container [2018-12-31 20:28:01,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:28:01" (1/1) ... [2018-12-31 20:28:01,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:28:02,064 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:28:02,488 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:28:02,503 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:28:02,707 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:28:02,789 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:28:02,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02 WrapperNode [2018-12-31 20:28:02,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:28:02,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:28:02,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:28:02,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:28:02,802 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:28:02" (1/1) ... [2018-12-31 20:28:02,830 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:28:02" (1/1) ... [2018-12-31 20:28:02,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:28:02,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:28:02,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:28:02,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:28:02,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (1/1) ... [2018-12-31 20:28:02,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:28:02,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:28:02,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:28:02,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:28:02,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (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:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:28:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:28:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:28:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:28:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:28:02,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:28:02,988 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:28:02,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:28:02,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:28:02,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:28:02,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:28:02,990 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:28:04,133 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:28:04,133 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:28:04,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:28:04 BoogieIcfgContainer [2018-12-31 20:28:04,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:28:04,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:28:04,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:28:04,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:28:04,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:28:01" (1/3) ... [2018-12-31 20:28:04,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8ccfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:28:04, skipping insertion in model container [2018-12-31 20:28:04,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:28:02" (2/3) ... [2018-12-31 20:28:04,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8ccfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:28:04, skipping insertion in model container [2018-12-31 20:28:04,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:28:04" (3/3) ... [2018-12-31 20:28:04,144 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc_false-unreach-call.i [2018-12-31 20:28:04,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,193 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,195 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,195 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,205 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:28:04,259 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:28:04,259 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:28:04,270 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:28:04,289 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:28:04,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:28:04,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:28:04,319 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:28:04,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:28:04,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:28:04,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:28:04,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:28:04,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:28:04,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:28:04,334 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-12-31 20:28:06,810 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-12-31 20:28:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-12-31 20:28:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 20:28:06,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:06,822 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] [2018-12-31 20:28:06,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-12-31 20:28:06,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:06,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:07,203 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:28:07,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:07,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:07,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:07,234 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-12-31 20:28:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:09,322 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-12-31 20:28:09,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:09,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-31 20:28:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:09,736 INFO L225 Difference]: With dead ends: 60794 [2018-12-31 20:28:09,737 INFO L226 Difference]: Without dead ends: 44274 [2018-12-31 20:28:09,739 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:28:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-12-31 20:28:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-12-31 20:28:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-31 20:28:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-12-31 20:28:11,724 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-12-31 20:28:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:11,725 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-12-31 20:28:11,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-12-31 20:28:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 20:28:11,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:11,736 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] [2018-12-31 20:28:11,737 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-12-31 20:28:11,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:11,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:11,873 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:28:11,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:11,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:11,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:11,877 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 3 states. [2018-12-31 20:28:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:12,646 INFO L93 Difference]: Finished difference Result 27342 states and 105226 transitions. [2018-12-31 20:28:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:12,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 20:28:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:12,785 INFO L225 Difference]: With dead ends: 27342 [2018-12-31 20:28:12,786 INFO L226 Difference]: Without dead ends: 27342 [2018-12-31 20:28:12,787 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:28:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27342 states. [2018-12-31 20:28:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27342 to 27342. [2018-12-31 20:28:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-31 20:28:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105226 transitions. [2018-12-31 20:28:14,176 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105226 transitions. Word has length 49 [2018-12-31 20:28:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:14,177 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105226 transitions. [2018-12-31 20:28:14,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105226 transitions. [2018-12-31 20:28:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 20:28:14,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:14,183 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] [2018-12-31 20:28:14,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1687880217, now seen corresponding path program 1 times [2018-12-31 20:28:14,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:14,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:14,356 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:28:14,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:14,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:14,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:14,363 INFO L87 Difference]: Start difference. First operand 27342 states and 105226 transitions. Second operand 4 states. [2018-12-31 20:28:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:14,661 INFO L93 Difference]: Finished difference Result 8532 states and 28324 transitions. [2018-12-31 20:28:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:14,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-31 20:28:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:14,701 INFO L225 Difference]: With dead ends: 8532 [2018-12-31 20:28:14,702 INFO L226 Difference]: Without dead ends: 7470 [2018-12-31 20:28:14,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-31 20:28:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 7470. [2018-12-31 20:28:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7470 states. [2018-12-31 20:28:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 24616 transitions. [2018-12-31 20:28:14,875 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 24616 transitions. Word has length 49 [2018-12-31 20:28:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:14,876 INFO L480 AbstractCegarLoop]: Abstraction has 7470 states and 24616 transitions. [2018-12-31 20:28:14,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 24616 transitions. [2018-12-31 20:28:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 20:28:14,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:14,879 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] [2018-12-31 20:28:14,879 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:14,880 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-12-31 20:28:14,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:14,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:15,130 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:28:15,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:15,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:15,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:15,132 INFO L87 Difference]: Start difference. First operand 7470 states and 24616 transitions. Second operand 6 states. [2018-12-31 20:28:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:16,216 INFO L93 Difference]: Finished difference Result 9666 states and 31109 transitions. [2018-12-31 20:28:16,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:16,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-31 20:28:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:16,251 INFO L225 Difference]: With dead ends: 9666 [2018-12-31 20:28:16,251 INFO L226 Difference]: Without dead ends: 9598 [2018-12-31 20:28:16,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2018-12-31 20:28:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 9445. [2018-12-31 20:28:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-12-31 20:28:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 30522 transitions. [2018-12-31 20:28:16,473 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 30522 transitions. Word has length 50 [2018-12-31 20:28:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:16,475 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 30522 transitions. [2018-12-31 20:28:16,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 30522 transitions. [2018-12-31 20:28:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 20:28:16,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:16,479 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] [2018-12-31 20:28:16,479 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-12-31 20:28:16,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:16,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:16,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:16,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:16,572 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:28:16,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:16,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:16,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:16,575 INFO L87 Difference]: Start difference. First operand 9445 states and 30522 transitions. Second operand 3 states. [2018-12-31 20:28:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:16,922 INFO L93 Difference]: Finished difference Result 13283 states and 42597 transitions. [2018-12-31 20:28:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:16,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 20:28:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:16,959 INFO L225 Difference]: With dead ends: 13283 [2018-12-31 20:28:16,959 INFO L226 Difference]: Without dead ends: 13283 [2018-12-31 20:28:16,960 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:28:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2018-12-31 20:28:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 9849. [2018-12-31 20:28:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2018-12-31 20:28:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 31488 transitions. [2018-12-31 20:28:17,283 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 31488 transitions. Word has length 52 [2018-12-31 20:28:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:17,283 INFO L480 AbstractCegarLoop]: Abstraction has 9849 states and 31488 transitions. [2018-12-31 20:28:17,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 31488 transitions. [2018-12-31 20:28:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:28:17,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:17,288 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] [2018-12-31 20:28:17,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:17,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-12-31 20:28:17,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:17,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:17,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:17,573 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:28:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:17,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:17,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:17,575 INFO L87 Difference]: Start difference. First operand 9849 states and 31488 transitions. Second operand 6 states. [2018-12-31 20:28:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:18,885 INFO L93 Difference]: Finished difference Result 14207 states and 45036 transitions. [2018-12-31 20:28:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:28:18,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:28:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:18,913 INFO L225 Difference]: With dead ends: 14207 [2018-12-31 20:28:18,913 INFO L226 Difference]: Without dead ends: 14135 [2018-12-31 20:28:18,913 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:28:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2018-12-31 20:28:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 10853. [2018-12-31 20:28:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-12-31 20:28:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 34543 transitions. [2018-12-31 20:28:19,170 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 34543 transitions. Word has length 56 [2018-12-31 20:28:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:19,170 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 34543 transitions. [2018-12-31 20:28:19,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 34543 transitions. [2018-12-31 20:28:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 20:28:19,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:19,179 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] [2018-12-31 20:28:19,179 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-12-31 20:28:19,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:19,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:19,414 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:28:19,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:19,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:19,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:19,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:19,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:19,417 INFO L87 Difference]: Start difference. First operand 10853 states and 34543 transitions. Second operand 4 states. [2018-12-31 20:28:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:19,736 INFO L93 Difference]: Finished difference Result 12400 states and 39552 transitions. [2018-12-31 20:28:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:28:19,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 20:28:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:19,760 INFO L225 Difference]: With dead ends: 12400 [2018-12-31 20:28:19,760 INFO L226 Difference]: Without dead ends: 12400 [2018-12-31 20:28:19,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2018-12-31 20:28:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11373. [2018-12-31 20:28:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2018-12-31 20:28:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 36216 transitions. [2018-12-31 20:28:20,005 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 36216 transitions. Word has length 64 [2018-12-31 20:28:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:20,005 INFO L480 AbstractCegarLoop]: Abstraction has 11373 states and 36216 transitions. [2018-12-31 20:28:20,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 36216 transitions. [2018-12-31 20:28:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 20:28:20,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:20,014 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] [2018-12-31 20:28:20,014 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-12-31 20:28:20,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:20,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:20,314 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 20:28:20,466 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:28:20,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:20,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:28:20,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:28:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:28:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:20,469 INFO L87 Difference]: Start difference. First operand 11373 states and 36216 transitions. Second operand 8 states. [2018-12-31 20:28:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:21,754 INFO L93 Difference]: Finished difference Result 15745 states and 48962 transitions. [2018-12-31 20:28:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:28:21,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-12-31 20:28:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:21,781 INFO L225 Difference]: With dead ends: 15745 [2018-12-31 20:28:21,781 INFO L226 Difference]: Without dead ends: 15674 [2018-12-31 20:28:21,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-31 20:28:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2018-12-31 20:28:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 13759. [2018-12-31 20:28:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-31 20:28:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 43248 transitions. [2018-12-31 20:28:22,045 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 43248 transitions. Word has length 64 [2018-12-31 20:28:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 43248 transitions. [2018-12-31 20:28:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:28:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 43248 transitions. [2018-12-31 20:28:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:28:22,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:22,054 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] [2018-12-31 20:28:22,055 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1129581006, now seen corresponding path program 1 times [2018-12-31 20:28:22,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:22,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:22,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:22,160 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:28:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:22,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:22,161 INFO L87 Difference]: Start difference. First operand 13759 states and 43248 transitions. Second operand 4 states. [2018-12-31 20:28:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:23,305 INFO L93 Difference]: Finished difference Result 17639 states and 54553 transitions. [2018-12-31 20:28:23,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:23,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 20:28:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:23,335 INFO L225 Difference]: With dead ends: 17639 [2018-12-31 20:28:23,336 INFO L226 Difference]: Without dead ends: 17639 [2018-12-31 20:28:23,336 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:28:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2018-12-31 20:28:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 15797. [2018-12-31 20:28:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15797 states. [2018-12-31 20:28:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 49099 transitions. [2018-12-31 20:28:23,598 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 49099 transitions. Word has length 68 [2018-12-31 20:28:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:23,598 INFO L480 AbstractCegarLoop]: Abstraction has 15797 states and 49099 transitions. [2018-12-31 20:28:23,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 49099 transitions. [2018-12-31 20:28:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:28:23,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:23,609 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] [2018-12-31 20:28:23,610 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -947628337, now seen corresponding path program 1 times [2018-12-31 20:28:23,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:23,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:23,746 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:28:23,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:23,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:23,748 INFO L87 Difference]: Start difference. First operand 15797 states and 49099 transitions. Second operand 3 states. [2018-12-31 20:28:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:24,068 INFO L93 Difference]: Finished difference Result 16389 states and 50706 transitions. [2018-12-31 20:28:24,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:24,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 20:28:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:24,098 INFO L225 Difference]: With dead ends: 16389 [2018-12-31 20:28:24,098 INFO L226 Difference]: Without dead ends: 16389 [2018-12-31 20:28:24,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16389 states. [2018-12-31 20:28:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16389 to 16113. [2018-12-31 20:28:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16113 states. [2018-12-31 20:28:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16113 states to 16113 states and 49949 transitions. [2018-12-31 20:28:24,369 INFO L78 Accepts]: Start accepts. Automaton has 16113 states and 49949 transitions. Word has length 68 [2018-12-31 20:28:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:24,369 INFO L480 AbstractCegarLoop]: Abstraction has 16113 states and 49949 transitions. [2018-12-31 20:28:24,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16113 states and 49949 transitions. [2018-12-31 20:28:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:24,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:24,380 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] [2018-12-31 20:28:24,380 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-12-31 20:28:24,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:24,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:24,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:24,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:24,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:24,709 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:28:24,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:24,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:24,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:24,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:24,711 INFO L87 Difference]: Start difference. First operand 16113 states and 49949 transitions. Second operand 6 states. [2018-12-31 20:28:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:26,057 INFO L93 Difference]: Finished difference Result 19825 states and 60385 transitions. [2018-12-31 20:28:26,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:26,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 20:28:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:26,092 INFO L225 Difference]: With dead ends: 19825 [2018-12-31 20:28:26,092 INFO L226 Difference]: Without dead ends: 19825 [2018-12-31 20:28:26,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2018-12-31 20:28:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 18621. [2018-12-31 20:28:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2018-12-31 20:28:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 57173 transitions. [2018-12-31 20:28:26,383 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 57173 transitions. Word has length 70 [2018-12-31 20:28:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:26,384 INFO L480 AbstractCegarLoop]: Abstraction has 18621 states and 57173 transitions. [2018-12-31 20:28:26,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 57173 transitions. [2018-12-31 20:28:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:26,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:26,396 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] [2018-12-31 20:28:26,397 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:26,397 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-12-31 20:28:26,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:26,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:26,661 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:28:26,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:26,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:26,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:26,663 INFO L87 Difference]: Start difference. First operand 18621 states and 57173 transitions. Second operand 5 states. [2018-12-31 20:28:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:27,123 INFO L93 Difference]: Finished difference Result 24184 states and 73678 transitions. [2018-12-31 20:28:27,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:27,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:27,166 INFO L225 Difference]: With dead ends: 24184 [2018-12-31 20:28:27,166 INFO L226 Difference]: Without dead ends: 24184 [2018-12-31 20:28:27,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24184 states. [2018-12-31 20:28:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24184 to 22021. [2018-12-31 20:28:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2018-12-31 20:28:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 67098 transitions. [2018-12-31 20:28:27,507 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 67098 transitions. Word has length 70 [2018-12-31 20:28:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:27,508 INFO L480 AbstractCegarLoop]: Abstraction has 22021 states and 67098 transitions. [2018-12-31 20:28:27,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 67098 transitions. [2018-12-31 20:28:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:27,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:27,523 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] [2018-12-31 20:28:27,524 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-12-31 20:28:27,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:27,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:27,878 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:28:27,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:27,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:27,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:27,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:27,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:27,880 INFO L87 Difference]: Start difference. First operand 22021 states and 67098 transitions. Second operand 5 states. [2018-12-31 20:28:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:29,300 INFO L93 Difference]: Finished difference Result 30767 states and 92724 transitions. [2018-12-31 20:28:29,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:29,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:29,352 INFO L225 Difference]: With dead ends: 30767 [2018-12-31 20:28:29,353 INFO L226 Difference]: Without dead ends: 30767 [2018-12-31 20:28:29,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30767 states. [2018-12-31 20:28:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30767 to 27531. [2018-12-31 20:28:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2018-12-31 20:28:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 83415 transitions. [2018-12-31 20:28:29,781 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 83415 transitions. Word has length 70 [2018-12-31 20:28:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:29,781 INFO L480 AbstractCegarLoop]: Abstraction has 27531 states and 83415 transitions. [2018-12-31 20:28:29,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 83415 transitions. [2018-12-31 20:28:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:29,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:29,796 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] [2018-12-31 20:28:29,796 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-12-31 20:28:29,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:30,033 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:28:30,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:30,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:30,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:30,035 INFO L87 Difference]: Start difference. First operand 27531 states and 83415 transitions. Second operand 5 states. [2018-12-31 20:28:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:30,132 INFO L93 Difference]: Finished difference Result 8579 states and 21393 transitions. [2018-12-31 20:28:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:28:30,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:28:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:30,143 INFO L225 Difference]: With dead ends: 8579 [2018-12-31 20:28:30,143 INFO L226 Difference]: Without dead ends: 6751 [2018-12-31 20:28:30,143 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:28:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2018-12-31 20:28:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 5732. [2018-12-31 20:28:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5732 states. [2018-12-31 20:28:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5732 states to 5732 states and 13957 transitions. [2018-12-31 20:28:30,217 INFO L78 Accepts]: Start accepts. Automaton has 5732 states and 13957 transitions. Word has length 70 [2018-12-31 20:28:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:30,217 INFO L480 AbstractCegarLoop]: Abstraction has 5732 states and 13957 transitions. [2018-12-31 20:28:30,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5732 states and 13957 transitions. [2018-12-31 20:28:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:28:30,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:30,226 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] [2018-12-31 20:28:30,226 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-12-31 20:28:30,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:30,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:30,290 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:28:30,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:30,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:28:30,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:28:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:28:30,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:28:30,291 INFO L87 Difference]: Start difference. First operand 5732 states and 13957 transitions. Second operand 3 states. [2018-12-31 20:28:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:30,538 INFO L93 Difference]: Finished difference Result 7772 states and 18816 transitions. [2018-12-31 20:28:30,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:28:30,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-31 20:28:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:30,552 INFO L225 Difference]: With dead ends: 7772 [2018-12-31 20:28:30,552 INFO L226 Difference]: Without dead ends: 7772 [2018-12-31 20:28:30,553 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:28:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2018-12-31 20:28:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 5633. [2018-12-31 20:28:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5633 states. [2018-12-31 20:28:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 13442 transitions. [2018-12-31 20:28:30,665 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 13442 transitions. Word has length 70 [2018-12-31 20:28:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:30,665 INFO L480 AbstractCegarLoop]: Abstraction has 5633 states and 13442 transitions. [2018-12-31 20:28:30,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:28:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 13442 transitions. [2018-12-31 20:28:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 20:28:30,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:30,675 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] [2018-12-31 20:28:30,675 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-12-31 20:28:30,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:30,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:30,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:30,899 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:28:30,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:30,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:30,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:30,901 INFO L87 Difference]: Start difference. First operand 5633 states and 13442 transitions. Second operand 5 states. [2018-12-31 20:28:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:31,127 INFO L93 Difference]: Finished difference Result 6693 states and 15951 transitions. [2018-12-31 20:28:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:31,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-31 20:28:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:31,138 INFO L225 Difference]: With dead ends: 6693 [2018-12-31 20:28:31,138 INFO L226 Difference]: Without dead ends: 6693 [2018-12-31 20:28:31,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2018-12-31 20:28:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 6111. [2018-12-31 20:28:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6111 states. [2018-12-31 20:28:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 14600 transitions. [2018-12-31 20:28:31,210 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 14600 transitions. Word has length 76 [2018-12-31 20:28:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:31,211 INFO L480 AbstractCegarLoop]: Abstraction has 6111 states and 14600 transitions. [2018-12-31 20:28:31,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 14600 transitions. [2018-12-31 20:28:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 20:28:31,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:31,219 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] [2018-12-31 20:28:31,220 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-12-31 20:28:31,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:31,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:31,407 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:28:31,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:31,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:28:31,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:28:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:28:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:31,408 INFO L87 Difference]: Start difference. First operand 6111 states and 14600 transitions. Second operand 7 states. [2018-12-31 20:28:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:31,880 INFO L93 Difference]: Finished difference Result 6985 states and 16495 transitions. [2018-12-31 20:28:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:28:31,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-31 20:28:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:31,890 INFO L225 Difference]: With dead ends: 6985 [2018-12-31 20:28:31,890 INFO L226 Difference]: Without dead ends: 6866 [2018-12-31 20:28:31,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 20:28:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6866 states. [2018-12-31 20:28:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6866 to 6121. [2018-12-31 20:28:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2018-12-31 20:28:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14530 transitions. [2018-12-31 20:28:31,961 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14530 transitions. Word has length 76 [2018-12-31 20:28:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:31,961 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14530 transitions. [2018-12-31 20:28:31,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14530 transitions. [2018-12-31 20:28:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:28:31,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:31,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:31,972 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash -322598773, now seen corresponding path program 1 times [2018-12-31 20:28:31,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:31,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:32,163 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:28:32,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:32,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:32,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:32,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:32,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:32,166 INFO L87 Difference]: Start difference. First operand 6121 states and 14530 transitions. Second operand 4 states. [2018-12-31 20:28:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:32,484 INFO L93 Difference]: Finished difference Result 9288 states and 22114 transitions. [2018-12-31 20:28:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:32,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:28:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:32,497 INFO L225 Difference]: With dead ends: 9288 [2018-12-31 20:28:32,497 INFO L226 Difference]: Without dead ends: 9288 [2018-12-31 20:28:32,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2018-12-31 20:28:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 7057. [2018-12-31 20:28:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2018-12-31 20:28:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 16657 transitions. [2018-12-31 20:28:32,593 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 16657 transitions. Word has length 95 [2018-12-31 20:28:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:32,593 INFO L480 AbstractCegarLoop]: Abstraction has 7057 states and 16657 transitions. [2018-12-31 20:28:32,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 16657 transitions. [2018-12-31 20:28:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:28:32,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:32,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:32,601 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1151437829, now seen corresponding path program 2 times [2018-12-31 20:28:32,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:32,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:32,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:32,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:32,836 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:28:32,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:32,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:28:32,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:28:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:28:32,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:28:32,839 INFO L87 Difference]: Start difference. First operand 7057 states and 16657 transitions. Second operand 4 states. [2018-12-31 20:28:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:32,978 INFO L93 Difference]: Finished difference Result 7701 states and 18020 transitions. [2018-12-31 20:28:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:28:32,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:28:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:32,987 INFO L225 Difference]: With dead ends: 7701 [2018-12-31 20:28:32,988 INFO L226 Difference]: Without dead ends: 7701 [2018-12-31 20:28:32,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2018-12-31 20:28:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 7169. [2018-12-31 20:28:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2018-12-31 20:28:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 16856 transitions. [2018-12-31 20:28:33,070 INFO L78 Accepts]: Start accepts. Automaton has 7169 states and 16856 transitions. Word has length 95 [2018-12-31 20:28:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:33,070 INFO L480 AbstractCegarLoop]: Abstraction has 7169 states and 16856 transitions. [2018-12-31 20:28:33,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:28:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 16856 transitions. [2018-12-31 20:28:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:33,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:33,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:33,079 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash -542177049, now seen corresponding path program 1 times [2018-12-31 20:28:33,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:33,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:33,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:33,413 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:28:33,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:33,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:28:33,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:28:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:28:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:33,414 INFO L87 Difference]: Start difference. First operand 7169 states and 16856 transitions. Second operand 7 states. [2018-12-31 20:28:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:34,253 INFO L93 Difference]: Finished difference Result 8604 states and 20292 transitions. [2018-12-31 20:28:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:34,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:28:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:34,266 INFO L225 Difference]: With dead ends: 8604 [2018-12-31 20:28:34,266 INFO L226 Difference]: Without dead ends: 8604 [2018-12-31 20:28:34,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8604 states. [2018-12-31 20:28:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8604 to 7354. [2018-12-31 20:28:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7354 states. [2018-12-31 20:28:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7354 states to 7354 states and 17420 transitions. [2018-12-31 20:28:34,363 INFO L78 Accepts]: Start accepts. Automaton has 7354 states and 17420 transitions. Word has length 97 [2018-12-31 20:28:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:34,363 INFO L480 AbstractCegarLoop]: Abstraction has 7354 states and 17420 transitions. [2018-12-31 20:28:34,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7354 states and 17420 transitions. [2018-12-31 20:28:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:34,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:34,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:34,373 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1080620369, now seen corresponding path program 1 times [2018-12-31 20:28:34,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:34,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:34,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:34,496 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:28:34,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:34,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:34,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:34,497 INFO L87 Difference]: Start difference. First operand 7354 states and 17420 transitions. Second operand 5 states. [2018-12-31 20:28:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:34,630 INFO L93 Difference]: Finished difference Result 8305 states and 19555 transitions. [2018-12-31 20:28:34,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:34,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:28:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:34,641 INFO L225 Difference]: With dead ends: 8305 [2018-12-31 20:28:34,641 INFO L226 Difference]: Without dead ends: 8305 [2018-12-31 20:28:34,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8305 states. [2018-12-31 20:28:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8305 to 6381. [2018-12-31 20:28:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2018-12-31 20:28:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 15080 transitions. [2018-12-31 20:28:34,909 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 15080 transitions. Word has length 97 [2018-12-31 20:28:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:34,909 INFO L480 AbstractCegarLoop]: Abstraction has 6381 states and 15080 transitions. [2018-12-31 20:28:34,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 15080 transitions. [2018-12-31 20:28:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:34,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:34,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:34,919 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1335356914, now seen corresponding path program 1 times [2018-12-31 20:28:34,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:34,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:34,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:35,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:28:35,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:35,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:35,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:35,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:35,216 INFO L87 Difference]: Start difference. First operand 6381 states and 15080 transitions. Second operand 5 states. [2018-12-31 20:28:35,412 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 20:28:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:35,977 INFO L93 Difference]: Finished difference Result 10406 states and 24647 transitions. [2018-12-31 20:28:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:35,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:28:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:35,991 INFO L225 Difference]: With dead ends: 10406 [2018-12-31 20:28:35,991 INFO L226 Difference]: Without dead ends: 10328 [2018-12-31 20:28:35,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10328 states. [2018-12-31 20:28:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10328 to 7480. [2018-12-31 20:28:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2018-12-31 20:28:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 17748 transitions. [2018-12-31 20:28:36,087 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 17748 transitions. Word has length 97 [2018-12-31 20:28:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:36,088 INFO L480 AbstractCegarLoop]: Abstraction has 7480 states and 17748 transitions. [2018-12-31 20:28:36,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 17748 transitions. [2018-12-31 20:28:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:36,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:36,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:36,096 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash -90592433, now seen corresponding path program 1 times [2018-12-31 20:28:36,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:36,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:36,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:37,191 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 20:28:37,396 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:28:37,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:37,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:28:37,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:28:37,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:28:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:37,399 INFO L87 Difference]: Start difference. First operand 7480 states and 17748 transitions. Second operand 9 states. [2018-12-31 20:28:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:40,071 INFO L93 Difference]: Finished difference Result 10170 states and 24028 transitions. [2018-12-31 20:28:40,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 20:28:40,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:28:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:40,086 INFO L225 Difference]: With dead ends: 10170 [2018-12-31 20:28:40,086 INFO L226 Difference]: Without dead ends: 10138 [2018-12-31 20:28:40,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:28:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2018-12-31 20:28:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 8990. [2018-12-31 20:28:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2018-12-31 20:28:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 21261 transitions. [2018-12-31 20:28:40,206 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 21261 transitions. Word has length 97 [2018-12-31 20:28:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:40,206 INFO L480 AbstractCegarLoop]: Abstraction has 8990 states and 21261 transitions. [2018-12-31 20:28:40,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:28:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 21261 transitions. [2018-12-31 20:28:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:40,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:40,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:40,220 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1887543792, now seen corresponding path program 1 times [2018-12-31 20:28:40,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:40,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:40,390 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:28:40,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:40,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:28:40,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:28:40,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:28:40,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:40,393 INFO L87 Difference]: Start difference. First operand 8990 states and 21261 transitions. Second operand 8 states. [2018-12-31 20:28:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:41,184 INFO L93 Difference]: Finished difference Result 15259 states and 36630 transitions. [2018-12-31 20:28:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 20:28:41,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-12-31 20:28:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:41,204 INFO L225 Difference]: With dead ends: 15259 [2018-12-31 20:28:41,204 INFO L226 Difference]: Without dead ends: 15259 [2018-12-31 20:28:41,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:28:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2018-12-31 20:28:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 9590. [2018-12-31 20:28:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9590 states. [2018-12-31 20:28:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 22862 transitions. [2018-12-31 20:28:41,356 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 22862 transitions. Word has length 97 [2018-12-31 20:28:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:41,356 INFO L480 AbstractCegarLoop]: Abstraction has 9590 states and 22862 transitions. [2018-12-31 20:28:41,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:28:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 22862 transitions. [2018-12-31 20:28:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:41,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:41,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:41,370 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1000040111, now seen corresponding path program 1 times [2018-12-31 20:28:41,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:41,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:41,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:41,621 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:28:41,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:41,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:28:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:28:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:28:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:41,623 INFO L87 Difference]: Start difference. First operand 9590 states and 22862 transitions. Second operand 7 states. [2018-12-31 20:28:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:41,824 INFO L93 Difference]: Finished difference Result 12881 states and 30871 transitions. [2018-12-31 20:28:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:41,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:28:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:41,844 INFO L225 Difference]: With dead ends: 12881 [2018-12-31 20:28:41,844 INFO L226 Difference]: Without dead ends: 12881 [2018-12-31 20:28:41,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:28:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12881 states. [2018-12-31 20:28:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12881 to 9374. [2018-12-31 20:28:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9374 states. [2018-12-31 20:28:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 22128 transitions. [2018-12-31 20:28:41,985 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 22128 transitions. Word has length 97 [2018-12-31 20:28:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:41,985 INFO L480 AbstractCegarLoop]: Abstraction has 9374 states and 22128 transitions. [2018-12-31 20:28:41,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:28:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 22128 transitions. [2018-12-31 20:28:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:28:41,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:41,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:41,999 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1562951633, now seen corresponding path program 1 times [2018-12-31 20:28:42,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:42,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:42,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:42,327 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:28:42,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:42,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:42,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:42,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:42,328 INFO L87 Difference]: Start difference. First operand 9374 states and 22128 transitions. Second operand 6 states. [2018-12-31 20:28:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:42,479 INFO L93 Difference]: Finished difference Result 9102 states and 21176 transitions. [2018-12-31 20:28:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:42,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-31 20:28:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:42,493 INFO L225 Difference]: With dead ends: 9102 [2018-12-31 20:28:42,493 INFO L226 Difference]: Without dead ends: 9102 [2018-12-31 20:28:42,493 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:28:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2018-12-31 20:28:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 6113. [2018-12-31 20:28:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2018-12-31 20:28:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 14216 transitions. [2018-12-31 20:28:42,593 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 14216 transitions. Word has length 97 [2018-12-31 20:28:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:42,593 INFO L480 AbstractCegarLoop]: Abstraction has 6113 states and 14216 transitions. [2018-12-31 20:28:42,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 14216 transitions. [2018-12-31 20:28:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:42,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:42,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:42,601 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:42,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2018-12-31 20:28:42,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:42,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:42,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:42,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:42,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:43,021 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:28:43,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:43,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:28:43,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:28:43,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:28:43,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:28:43,023 INFO L87 Difference]: Start difference. First operand 6113 states and 14216 transitions. Second operand 10 states. [2018-12-31 20:28:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:43,696 INFO L93 Difference]: Finished difference Result 7896 states and 18254 transitions. [2018-12-31 20:28:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 20:28:43,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-31 20:28:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:43,708 INFO L225 Difference]: With dead ends: 7896 [2018-12-31 20:28:43,708 INFO L226 Difference]: Without dead ends: 7896 [2018-12-31 20:28:43,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:28:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2018-12-31 20:28:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 7564. [2018-12-31 20:28:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2018-12-31 20:28:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 17531 transitions. [2018-12-31 20:28:43,798 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 17531 transitions. Word has length 99 [2018-12-31 20:28:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:43,798 INFO L480 AbstractCegarLoop]: Abstraction has 7564 states and 17531 transitions. [2018-12-31 20:28:43,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:28:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 17531 transitions. [2018-12-31 20:28:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:43,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:43,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:43,807 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2018-12-31 20:28:43,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:43,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:44,070 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 20:28:44,225 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:28:44,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:44,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:28:44,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:28:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:28:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:28:44,227 INFO L87 Difference]: Start difference. First operand 7564 states and 17531 transitions. Second operand 10 states. [2018-12-31 20:28:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:45,226 INFO L93 Difference]: Finished difference Result 11381 states and 26409 transitions. [2018-12-31 20:28:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:28:45,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-31 20:28:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:45,237 INFO L225 Difference]: With dead ends: 11381 [2018-12-31 20:28:45,237 INFO L226 Difference]: Without dead ends: 8276 [2018-12-31 20:28:45,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-31 20:28:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2018-12-31 20:28:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 7697. [2018-12-31 20:28:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7697 states. [2018-12-31 20:28:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7697 states to 7697 states and 17804 transitions. [2018-12-31 20:28:45,328 INFO L78 Accepts]: Start accepts. Automaton has 7697 states and 17804 transitions. Word has length 99 [2018-12-31 20:28:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:45,328 INFO L480 AbstractCegarLoop]: Abstraction has 7697 states and 17804 transitions. [2018-12-31 20:28:45,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:28:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 17804 transitions. [2018-12-31 20:28:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:45,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:45,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:45,340 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 571332279, now seen corresponding path program 1 times [2018-12-31 20:28:45,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:45,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:45,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:45,792 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:28:46,072 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:28:46,089 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:28:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:46,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:28:46,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:28:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:28:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:28:46,091 INFO L87 Difference]: Start difference. First operand 7697 states and 17804 transitions. Second operand 6 states. [2018-12-31 20:28:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:46,291 INFO L93 Difference]: Finished difference Result 9307 states and 20920 transitions. [2018-12-31 20:28:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:28:46,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-31 20:28:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:46,305 INFO L225 Difference]: With dead ends: 9307 [2018-12-31 20:28:46,305 INFO L226 Difference]: Without dead ends: 9261 [2018-12-31 20:28:46,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:28:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9261 states. [2018-12-31 20:28:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9261 to 7799. [2018-12-31 20:28:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7799 states. [2018-12-31 20:28:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 17692 transitions. [2018-12-31 20:28:46,431 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 17692 transitions. Word has length 99 [2018-12-31 20:28:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:46,432 INFO L480 AbstractCegarLoop]: Abstraction has 7799 states and 17692 transitions. [2018-12-31 20:28:46,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:28:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 17692 transitions. [2018-12-31 20:28:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:46,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:46,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:46,443 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1679511564, now seen corresponding path program 1 times [2018-12-31 20:28:46,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:46,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:46,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:46,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:46,733 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:28:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:28:46,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:28:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:28:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:28:46,734 INFO L87 Difference]: Start difference. First operand 7799 states and 17692 transitions. Second operand 5 states. [2018-12-31 20:28:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:47,000 INFO L93 Difference]: Finished difference Result 9299 states and 20944 transitions. [2018-12-31 20:28:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:28:47,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-31 20:28:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:47,013 INFO L225 Difference]: With dead ends: 9299 [2018-12-31 20:28:47,013 INFO L226 Difference]: Without dead ends: 9221 [2018-12-31 20:28:47,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2018-12-31 20:28:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 7315. [2018-12-31 20:28:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2018-12-31 20:28:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 16679 transitions. [2018-12-31 20:28:47,111 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 16679 transitions. Word has length 99 [2018-12-31 20:28:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:47,111 INFO L480 AbstractCegarLoop]: Abstraction has 7315 states and 16679 transitions. [2018-12-31 20:28:47,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:28:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 16679 transitions. [2018-12-31 20:28:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:47,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:47,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:47,120 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1922354035, now seen corresponding path program 2 times [2018-12-31 20:28:47,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:47,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:47,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:28:47,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:47,340 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:28:47,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:47,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:28:47,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:28:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:28:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:28:47,341 INFO L87 Difference]: Start difference. First operand 7315 states and 16679 transitions. Second operand 8 states. [2018-12-31 20:28:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:47,716 INFO L93 Difference]: Finished difference Result 7809 states and 17694 transitions. [2018-12-31 20:28:47,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:28:47,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-31 20:28:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:47,728 INFO L225 Difference]: With dead ends: 7809 [2018-12-31 20:28:47,728 INFO L226 Difference]: Without dead ends: 7809 [2018-12-31 20:28:47,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:28:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states. [2018-12-31 20:28:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 7367. [2018-12-31 20:28:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7367 states. [2018-12-31 20:28:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 16787 transitions. [2018-12-31 20:28:47,856 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 16787 transitions. Word has length 99 [2018-12-31 20:28:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 7367 states and 16787 transitions. [2018-12-31 20:28:47,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:28:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 16787 transitions. [2018-12-31 20:28:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:47,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:47,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:47,865 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash 122635640, now seen corresponding path program 2 times [2018-12-31 20:28:47,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:47,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:47,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:47,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:47,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:48,034 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:28:48,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:48,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:28:48,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:28:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:28:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:28:48,036 INFO L87 Difference]: Start difference. First operand 7367 states and 16787 transitions. Second operand 9 states. [2018-12-31 20:28:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:48,247 INFO L93 Difference]: Finished difference Result 11302 states and 25841 transitions. [2018-12-31 20:28:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:28:48,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-31 20:28:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:48,254 INFO L225 Difference]: With dead ends: 11302 [2018-12-31 20:28:48,254 INFO L226 Difference]: Without dead ends: 4136 [2018-12-31 20:28:48,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-31 20:28:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2018-12-31 20:28:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 4136. [2018-12-31 20:28:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4136 states. [2018-12-31 20:28:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 9455 transitions. [2018-12-31 20:28:48,299 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 9455 transitions. Word has length 99 [2018-12-31 20:28:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:48,299 INFO L480 AbstractCegarLoop]: Abstraction has 4136 states and 9455 transitions. [2018-12-31 20:28:48,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:28:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 9455 transitions. [2018-12-31 20:28:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:48,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:48,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:48,305 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2125986836, now seen corresponding path program 3 times [2018-12-31 20:28:48,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:48,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:48,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:28:48,566 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:28:48,744 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 20:28:49,893 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:28:49,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:28:49,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:28:49,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:28:49,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:28:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:28:49,895 INFO L87 Difference]: Start difference. First operand 4136 states and 9455 transitions. Second operand 11 states. [2018-12-31 20:28:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:28:50,867 INFO L93 Difference]: Finished difference Result 8712 states and 20079 transitions. [2018-12-31 20:28:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:28:50,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-31 20:28:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:28:50,876 INFO L225 Difference]: With dead ends: 8712 [2018-12-31 20:28:50,876 INFO L226 Difference]: Without dead ends: 5589 [2018-12-31 20:28:50,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:28:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2018-12-31 20:28:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 4167. [2018-12-31 20:28:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4167 states. [2018-12-31 20:28:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 9471 transitions. [2018-12-31 20:28:50,930 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 9471 transitions. Word has length 99 [2018-12-31 20:28:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:28:50,930 INFO L480 AbstractCegarLoop]: Abstraction has 4167 states and 9471 transitions. [2018-12-31 20:28:50,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:28:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 9471 transitions. [2018-12-31 20:28:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:28:50,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:28:50,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:28:50,936 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:28:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:28:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash 303731124, now seen corresponding path program 4 times [2018-12-31 20:28:50,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:28:50,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:28:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:50,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:28:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:28:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:28:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:28:51,027 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:28:51,241 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:28:51,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:28:51 BasicIcfg [2018-12-31 20:28:51,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:28:51,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:28:51,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:28:51,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:28:51,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:28:04" (3/4) ... [2018-12-31 20:28:51,255 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:28:51,500 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:28:51,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:28:51,507 INFO L168 Benchmark]: Toolchain (without parser) took 49532.20 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 947.3 MB in the beginning and 1.9 GB in the end (delta: -982.4 MB). Peak memory consumption was 952.3 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:51,508 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:28:51,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:51,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:51,509 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:28:51,509 INFO L168 Benchmark]: RCFGBuilder took 1219.87 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:51,509 INFO L168 Benchmark]: TraceAbstraction took 47107.70 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -940.2 MB). Peak memory consumption was 885.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:51,514 INFO L168 Benchmark]: Witness Printer took 262.08 ms. Allocated memory is still 3.0 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-12-31 20:28:51,517 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 813.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1219.87 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47107.70 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -940.2 MB). Peak memory consumption was 885.9 MB. Max. memory is 11.5 GB. * Witness Printer took 262.08 ms. Allocated memory is still 3.0 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 46.9s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 24.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8556 SDtfs, 9153 SDslu, 21489 SDs, 0 SdLazy, 8504 SolverSat, 423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 87 SyntacticMatches, 28 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34810occurred 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: 8.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 68190 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2720 NumberOfCodeBlocks, 2720 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2588 ConstructedInterpolants, 0 QuantifiedInterpolants, 635907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...