./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi007_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi007_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f73d443d0449235d8d4676232537e99cd6a0d739 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 03:45:58,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:45:58,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:45:58,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:45:58,958 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:45:58,959 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:45:58,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:45:58,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:45:58,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:45:58,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:45:58,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:45:58,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:45:58,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:45:58,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:45:58,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:45:58,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:45:58,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:45:58,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:45:58,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:45:58,978 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:45:58,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:45:58,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:45:58,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:45:58,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:45:58,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:45:58,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:45:58,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:45:58,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:45:58,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:45:58,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:45:58,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:45:58,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:45:58,992 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:45:58,992 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:45:58,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:45:58,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:45:58,995 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:45:59,012 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:45:59,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:45:59,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:45:59,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:45:59,015 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:45:59,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:45:59,016 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:45:59,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:45:59,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:45:59,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:45:59,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:45:59,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:45:59,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:45:59,020 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:45:59,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:45:59,020 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:45:59,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:45:59,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:45:59,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:45:59,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:45:59,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:45:59,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:45:59,026 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:45:59,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:45:59,026 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:45:59,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:45:59,027 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:45:59,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:45:59,027 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 -> f73d443d0449235d8d4676232537e99cd6a0d739 [2019-01-13 03:45:59,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:45:59,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:45:59,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:45:59,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:45:59,098 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:45:59,099 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi007_power.opt_false-unreach-call.i [2019-01-13 03:45:59,165 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02470dc/281f7580a6bd4d6f937be090e8373b4e/FLAG879481b10 [2019-01-13 03:45:59,720 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:45:59,723 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi007_power.opt_false-unreach-call.i [2019-01-13 03:45:59,743 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02470dc/281f7580a6bd4d6f937be090e8373b4e/FLAG879481b10 [2019-01-13 03:45:59,976 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02470dc/281f7580a6bd4d6f937be090e8373b4e [2019-01-13 03:45:59,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:45:59,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:45:59,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:45:59,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:45:59,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:45:59,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:45:59" (1/1) ... [2019-01-13 03:45:59,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d822aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:45:59, skipping insertion in model container [2019-01-13 03:45:59,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:45:59" (1/1) ... [2019-01-13 03:45:59,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:46:00,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:46:00,515 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:46:00,529 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:46:00,711 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:46:00,800 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:46:00,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00 WrapperNode [2019-01-13 03:46:00,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:46:00,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:46:00,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:46:00,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:46:00,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:46:00,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:46:00,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:46:00,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:46:00,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... [2019-01-13 03:46:00,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:46:00,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:46:00,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:46:00,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:46:00,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:46:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:46:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:46:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:46:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:46:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:46:00,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:46:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:46:00,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:46:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:46:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:46:00,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:46:00,980 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:46:02,057 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:46:02,058 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:46:02,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:46:02 BoogieIcfgContainer [2019-01-13 03:46:02,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:46:02,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:46:02,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:46:02,065 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:46:02,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:45:59" (1/3) ... [2019-01-13 03:46:02,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b785a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:46:02, skipping insertion in model container [2019-01-13 03:46:02,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:46:00" (2/3) ... [2019-01-13 03:46:02,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b785a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:46:02, skipping insertion in model container [2019-01-13 03:46:02,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:46:02" (3/3) ... [2019-01-13 03:46:02,069 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.opt_false-unreach-call.i [2019-01-13 03:46:02,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,114 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,114 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,114 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,115 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,116 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,125 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,126 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,127 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,127 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:46:02,183 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:46:02,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:46:02,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:46:02,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:46:02,237 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:46:02,238 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:46:02,238 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:46:02,238 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:46:02,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:46:02,239 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:46:02,239 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:46:02,239 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:46:02,239 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:46:02,257 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 03:46:04,661 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2019-01-13 03:46:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2019-01-13 03:46:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 03:46:04,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:04,671 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] [2019-01-13 03:46:04,674 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2019-01-13 03:46:04,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:04,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:04,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:04,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:05,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:05,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:05,083 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2019-01-13 03:46:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:06,588 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2019-01-13 03:46:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:46:06,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-13 03:46:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:06,920 INFO L225 Difference]: With dead ends: 60790 [2019-01-13 03:46:06,920 INFO L226 Difference]: Without dead ends: 44270 [2019-01-13 03:46:06,922 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 [2019-01-13 03:46:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2019-01-13 03:46:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2019-01-13 03:46:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2019-01-13 03:46:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2019-01-13 03:46:08,782 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2019-01-13 03:46:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:08,782 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2019-01-13 03:46:08,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2019-01-13 03:46:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 03:46:08,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:08,800 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] [2019-01-13 03:46:08,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2019-01-13 03:46:08,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:08,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:08,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:08,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:08,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:08,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:08,991 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2019-01-13 03:46:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:09,377 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2019-01-13 03:46:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:46:09,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 03:46:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:09,419 INFO L225 Difference]: With dead ends: 8528 [2019-01-13 03:46:09,419 INFO L226 Difference]: Without dead ends: 7466 [2019-01-13 03:46:09,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-01-13 03:46:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2019-01-13 03:46:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-01-13 03:46:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2019-01-13 03:46:09,659 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2019-01-13 03:46:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:09,660 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2019-01-13 03:46:09,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2019-01-13 03:46:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 03:46:09,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:09,664 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] [2019-01-13 03:46:09,665 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2019-01-13 03:46:09,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:09,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:10,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:10,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:10,010 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2019-01-13 03:46:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:11,297 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2019-01-13 03:46:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:46:11,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 03:46:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:11,376 INFO L225 Difference]: With dead ends: 13998 [2019-01-13 03:46:11,376 INFO L226 Difference]: Without dead ends: 13930 [2019-01-13 03:46:11,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:46:11,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2019-01-13 03:46:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2019-01-13 03:46:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-01-13 03:46:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2019-01-13 03:46:12,048 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2019-01-13 03:46:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:12,050 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2019-01-13 03:46:12,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2019-01-13 03:46:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 03:46:12,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:12,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] [2019-01-13 03:46:12,055 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2019-01-13 03:46:12,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:12,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:12,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:12,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:46:12,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:46:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:46:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:46:12,149 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2019-01-13 03:46:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:12,456 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2019-01-13 03:46:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:46:12,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-13 03:46:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:12,489 INFO L225 Difference]: With dead ends: 13279 [2019-01-13 03:46:12,490 INFO L226 Difference]: Without dead ends: 13279 [2019-01-13 03:46:12,490 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 [2019-01-13 03:46:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2019-01-13 03:46:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2019-01-13 03:46:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2019-01-13 03:46:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2019-01-13 03:46:12,773 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2019-01-13 03:46:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:12,773 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2019-01-13 03:46:12,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:46:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2019-01-13 03:46:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 03:46:12,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:12,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:46:12,779 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2019-01-13 03:46:12,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:12,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:12,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:13,086 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 03:46:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:13,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:13,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:46:13,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:46:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:46:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:13,208 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2019-01-13 03:46:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:14,259 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2019-01-13 03:46:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:46:14,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-01-13 03:46:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:14,292 INFO L225 Difference]: With dead ends: 12285 [2019-01-13 03:46:14,292 INFO L226 Difference]: Without dead ends: 12213 [2019-01-13 03:46:14,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:46:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2019-01-13 03:46:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2019-01-13 03:46:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2019-01-13 03:46:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2019-01-13 03:46:14,577 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2019-01-13 03:46:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:14,577 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2019-01-13 03:46:14,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:46:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2019-01-13 03:46:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 03:46:14,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:14,585 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] [2019-01-13 03:46:14,586 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2019-01-13 03:46:14,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:14,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:14,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:14,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:14,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:14,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:14,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:14,798 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2019-01-13 03:46:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:14,980 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2019-01-13 03:46:14,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:46:14,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-13 03:46:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:15,005 INFO L225 Difference]: With dead ends: 12396 [2019-01-13 03:46:15,005 INFO L226 Difference]: Without dead ends: 12396 [2019-01-13 03:46:15,005 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 [2019-01-13 03:46:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2019-01-13 03:46:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2019-01-13 03:46:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2019-01-13 03:46:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2019-01-13 03:46:15,243 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2019-01-13 03:46:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:15,244 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2019-01-13 03:46:15,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2019-01-13 03:46:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 03:46:15,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:15,252 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] [2019-01-13 03:46:15,253 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2019-01-13 03:46:15,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:15,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:15,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:15,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:15,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:46:15,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:46:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:46:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:46:15,644 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2019-01-13 03:46:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:16,535 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2019-01-13 03:46:16,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:46:16,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-13 03:46:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:16,576 INFO L225 Difference]: With dead ends: 20969 [2019-01-13 03:46:16,576 INFO L226 Difference]: Without dead ends: 20898 [2019-01-13 03:46:16,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:46:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2019-01-13 03:46:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2019-01-13 03:46:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2019-01-13 03:46:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2019-01-13 03:46:17,186 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2019-01-13 03:46:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:17,186 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2019-01-13 03:46:17,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:46:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2019-01-13 03:46:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:46:17,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:17,195 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] [2019-01-13 03:46:17,195 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1900874254, now seen corresponding path program 1 times [2019-01-13 03:46:17,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:17,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:17,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:17,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:17,373 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2019-01-13 03:46:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:17,889 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2019-01-13 03:46:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:46:17,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 03:46:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:17,929 INFO L225 Difference]: With dead ends: 23352 [2019-01-13 03:46:17,930 INFO L226 Difference]: Without dead ends: 23352 [2019-01-13 03:46:17,930 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 [2019-01-13 03:46:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2019-01-13 03:46:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2019-01-13 03:46:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2019-01-13 03:46:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2019-01-13 03:46:18,227 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2019-01-13 03:46:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:18,227 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2019-01-13 03:46:18,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2019-01-13 03:46:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:46:18,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:18,236 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] [2019-01-13 03:46:18,237 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2100690035, now seen corresponding path program 1 times [2019-01-13 03:46:18,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:18,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:18,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:18,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:18,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:18,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:18,495 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2019-01-13 03:46:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:19,008 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2019-01-13 03:46:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:46:19,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 03:46:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:19,041 INFO L225 Difference]: With dead ends: 18411 [2019-01-13 03:46:19,041 INFO L226 Difference]: Without dead ends: 18411 [2019-01-13 03:46:19,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-01-13 03:46:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2019-01-13 03:46:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2019-01-13 03:46:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2019-01-13 03:46:19,324 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2019-01-13 03:46:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:19,324 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2019-01-13 03:46:19,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2019-01-13 03:46:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:46:19,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:19,337 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] [2019-01-13 03:46:19,337 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1139076018, now seen corresponding path program 1 times [2019-01-13 03:46:19,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:19,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:19,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:19,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:46:19,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:46:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:46:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:46:19,400 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2019-01-13 03:46:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:20,015 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2019-01-13 03:46:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:46:20,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-13 03:46:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:20,042 INFO L225 Difference]: With dead ends: 17193 [2019-01-13 03:46:20,042 INFO L226 Difference]: Without dead ends: 17193 [2019-01-13 03:46:20,042 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 [2019-01-13 03:46:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-01-13 03:46:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2019-01-13 03:46:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2019-01-13 03:46:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2019-01-13 03:46:20,289 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2019-01-13 03:46:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:20,289 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2019-01-13 03:46:20,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:46:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2019-01-13 03:46:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:20,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:20,299 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] [2019-01-13 03:46:20,299 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 380916983, now seen corresponding path program 1 times [2019-01-13 03:46:20,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:20,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:20,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:20,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:20,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:46:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:46:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:46:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:46:20,481 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2019-01-13 03:46:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:22,067 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2019-01-13 03:46:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:46:22,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 03:46:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:22,101 INFO L225 Difference]: With dead ends: 20789 [2019-01-13 03:46:22,101 INFO L226 Difference]: Without dead ends: 20789 [2019-01-13 03:46:22,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2019-01-13 03:46:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2019-01-13 03:46:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2019-01-13 03:46:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2019-01-13 03:46:22,390 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2019-01-13 03:46:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:22,390 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2019-01-13 03:46:22,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:46:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2019-01-13 03:46:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:22,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:22,402 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] [2019-01-13 03:46:22,403 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1342531000, now seen corresponding path program 1 times [2019-01-13 03:46:22,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:22,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:22,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:22,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:46:22,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:46:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:46:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:46:22,683 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2019-01-13 03:46:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:23,483 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2019-01-13 03:46:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:46:23,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 03:46:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:23,523 INFO L225 Difference]: With dead ends: 22441 [2019-01-13 03:46:23,524 INFO L226 Difference]: Without dead ends: 22441 [2019-01-13 03:46:23,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:46:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2019-01-13 03:46:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2019-01-13 03:46:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2019-01-13 03:46:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2019-01-13 03:46:23,862 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2019-01-13 03:46:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:23,862 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2019-01-13 03:46:23,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:46:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2019-01-13 03:46:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:23,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:23,876 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] [2019-01-13 03:46:23,876 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1707671815, now seen corresponding path program 1 times [2019-01-13 03:46:23,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:24,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:24,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:24,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:24,307 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2019-01-13 03:46:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:24,906 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2019-01-13 03:46:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:46:24,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 03:46:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:24,954 INFO L225 Difference]: With dead ends: 26432 [2019-01-13 03:46:24,954 INFO L226 Difference]: Without dead ends: 26432 [2019-01-13 03:46:24,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2019-01-13 03:46:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2019-01-13 03:46:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2019-01-13 03:46:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2019-01-13 03:46:25,893 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2019-01-13 03:46:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:25,894 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2019-01-13 03:46:25,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2019-01-13 03:46:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:25,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:25,909 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] [2019-01-13 03:46:25,909 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:25,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2076761304, now seen corresponding path program 1 times [2019-01-13 03:46:25,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:25,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:25,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:25,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:25,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:26,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:26,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:26,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:26,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:26,190 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2019-01-13 03:46:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:26,891 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2019-01-13 03:46:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:46:26,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 03:46:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:26,945 INFO L225 Difference]: With dead ends: 33063 [2019-01-13 03:46:26,945 INFO L226 Difference]: Without dead ends: 33063 [2019-01-13 03:46:26,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:46:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2019-01-13 03:46:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2019-01-13 03:46:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2019-01-13 03:46:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2019-01-13 03:46:27,375 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2019-01-13 03:46:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:27,375 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2019-01-13 03:46:27,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2019-01-13 03:46:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:27,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:27,388 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] [2019-01-13 03:46:27,389 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash 269306841, now seen corresponding path program 1 times [2019-01-13 03:46:27,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:27,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:27,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:27,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:27,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:27,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:27,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:27,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:27,630 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 4 states. [2019-01-13 03:46:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:28,397 INFO L93 Difference]: Finished difference Result 38903 states and 116585 transitions. [2019-01-13 03:46:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:46:28,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:46:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:28,470 INFO L225 Difference]: With dead ends: 38903 [2019-01-13 03:46:28,470 INFO L226 Difference]: Without dead ends: 38671 [2019-01-13 03:46:28,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38671 states. [2019-01-13 03:46:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38671 to 35807. [2019-01-13 03:46:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2019-01-13 03:46:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2019-01-13 03:46:28,986 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2019-01-13 03:46:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:28,986 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2019-01-13 03:46:28,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2019-01-13 03:46:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:29,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:29,000 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] [2019-01-13 03:46:29,001 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1527644518, now seen corresponding path program 1 times [2019-01-13 03:46:29,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:29,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:29,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:29,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:29,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:46:29,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:46:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:46:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:29,324 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 7 states. [2019-01-13 03:46:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:29,974 INFO L93 Difference]: Finished difference Result 31667 states and 90728 transitions. [2019-01-13 03:46:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:46:29,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-01-13 03:46:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:30,018 INFO L225 Difference]: With dead ends: 31667 [2019-01-13 03:46:30,018 INFO L226 Difference]: Without dead ends: 31667 [2019-01-13 03:46:30,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:46:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31667 states. [2019-01-13 03:46:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31667 to 25460. [2019-01-13 03:46:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25460 states. [2019-01-13 03:46:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25460 states to 25460 states and 73006 transitions. [2019-01-13 03:46:30,596 INFO L78 Accepts]: Start accepts. Automaton has 25460 states and 73006 transitions. Word has length 66 [2019-01-13 03:46:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:30,596 INFO L480 AbstractCegarLoop]: Abstraction has 25460 states and 73006 transitions. [2019-01-13 03:46:30,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:46:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 25460 states and 73006 transitions. [2019-01-13 03:46:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:30,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:30,606 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] [2019-01-13 03:46:30,607 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash -640140837, now seen corresponding path program 1 times [2019-01-13 03:46:30,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:30,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:30,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:30,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:30,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:30,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:30,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:30,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:30,737 INFO L87 Difference]: Start difference. First operand 25460 states and 73006 transitions. Second operand 5 states. [2019-01-13 03:46:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:30,787 INFO L93 Difference]: Finished difference Result 7460 states and 17978 transitions. [2019-01-13 03:46:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:46:30,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 03:46:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:30,797 INFO L225 Difference]: With dead ends: 7460 [2019-01-13 03:46:30,797 INFO L226 Difference]: Without dead ends: 6135 [2019-01-13 03:46:30,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2019-01-13 03:46:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5529. [2019-01-13 03:46:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2019-01-13 03:46:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 12867 transitions. [2019-01-13 03:46:30,856 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 12867 transitions. Word has length 66 [2019-01-13 03:46:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:30,856 INFO L480 AbstractCegarLoop]: Abstraction has 5529 states and 12867 transitions. [2019-01-13 03:46:30,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 12867 transitions. [2019-01-13 03:46:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:46:30,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:30,861 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] [2019-01-13 03:46:30,862 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2019-01-13 03:46:30,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:30,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:30,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:30,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:46:30,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:46:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:46:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:46:30,940 INFO L87 Difference]: Start difference. First operand 5529 states and 12867 transitions. Second operand 3 states. [2019-01-13 03:46:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:31,005 INFO L93 Difference]: Finished difference Result 7165 states and 16473 transitions. [2019-01-13 03:46:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:46:31,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 03:46:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:31,013 INFO L225 Difference]: With dead ends: 7165 [2019-01-13 03:46:31,013 INFO L226 Difference]: Without dead ends: 7165 [2019-01-13 03:46:31,013 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 [2019-01-13 03:46:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-01-13 03:46:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 5468. [2019-01-13 03:46:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2019-01-13 03:46:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12407 transitions. [2019-01-13 03:46:31,071 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12407 transitions. Word has length 66 [2019-01-13 03:46:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:31,072 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12407 transitions. [2019-01-13 03:46:31,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:46:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12407 transitions. [2019-01-13 03:46:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:46:31,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:31,077 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] [2019-01-13 03:46:31,078 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2019-01-13 03:46:31,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:31,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:31,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:31,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:31,402 INFO L87 Difference]: Start difference. First operand 5468 states and 12407 transitions. Second operand 5 states. [2019-01-13 03:46:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:31,653 INFO L93 Difference]: Finished difference Result 6622 states and 15012 transitions. [2019-01-13 03:46:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:46:31,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-13 03:46:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:31,662 INFO L225 Difference]: With dead ends: 6622 [2019-01-13 03:46:31,662 INFO L226 Difference]: Without dead ends: 6622 [2019-01-13 03:46:31,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:46:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2019-01-13 03:46:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 5912. [2019-01-13 03:46:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-01-13 03:46:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 13411 transitions. [2019-01-13 03:46:31,725 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 13411 transitions. Word has length 72 [2019-01-13 03:46:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:31,725 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 13411 transitions. [2019-01-13 03:46:31,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 13411 transitions. [2019-01-13 03:46:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:46:31,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:31,731 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] [2019-01-13 03:46:31,731 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:31,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2019-01-13 03:46:31,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:31,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:31,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:31,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:31,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:46:31,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:46:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:46:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:46:31,999 INFO L87 Difference]: Start difference. First operand 5912 states and 13411 transitions. Second operand 9 states. [2019-01-13 03:46:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:32,861 INFO L93 Difference]: Finished difference Result 7374 states and 16560 transitions. [2019-01-13 03:46:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:46:32,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-01-13 03:46:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:32,871 INFO L225 Difference]: With dead ends: 7374 [2019-01-13 03:46:32,871 INFO L226 Difference]: Without dead ends: 7272 [2019-01-13 03:46:32,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 03:46:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2019-01-13 03:46:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6009. [2019-01-13 03:46:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2019-01-13 03:46:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 13504 transitions. [2019-01-13 03:46:32,936 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 13504 transitions. Word has length 72 [2019-01-13 03:46:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:32,936 INFO L480 AbstractCegarLoop]: Abstraction has 6009 states and 13504 transitions. [2019-01-13 03:46:32,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:46:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 13504 transitions. [2019-01-13 03:46:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:46:32,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:32,943 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] [2019-01-13 03:46:32,943 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1727591485, now seen corresponding path program 1 times [2019-01-13 03:46:32,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:32,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:32,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:33,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:33,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:46:33,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:46:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:46:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:33,190 INFO L87 Difference]: Start difference. First operand 6009 states and 13504 transitions. Second operand 7 states. [2019-01-13 03:46:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:35,324 INFO L93 Difference]: Finished difference Result 7489 states and 16833 transitions. [2019-01-13 03:46:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:46:35,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 03:46:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:35,334 INFO L225 Difference]: With dead ends: 7489 [2019-01-13 03:46:35,334 INFO L226 Difference]: Without dead ends: 7489 [2019-01-13 03:46:35,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2019-01-13 03:46:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 6149. [2019-01-13 03:46:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2019-01-13 03:46:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 13892 transitions. [2019-01-13 03:46:35,407 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 13892 transitions. Word has length 93 [2019-01-13 03:46:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 6149 states and 13892 transitions. [2019-01-13 03:46:35,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:46:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 13892 transitions. [2019-01-13 03:46:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:46:35,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:35,415 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] [2019-01-13 03:46:35,415 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1288795480, now seen corresponding path program 1 times [2019-01-13 03:46:35,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:35,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:35,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:35,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:35,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:35,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:35,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:35,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:35,612 INFO L87 Difference]: Start difference. First operand 6149 states and 13892 transitions. Second operand 5 states. [2019-01-13 03:46:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:35,951 INFO L93 Difference]: Finished difference Result 7107 states and 15967 transitions. [2019-01-13 03:46:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:46:35,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:46:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:35,962 INFO L225 Difference]: With dead ends: 7107 [2019-01-13 03:46:35,962 INFO L226 Difference]: Without dead ends: 7107 [2019-01-13 03:46:35,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:46:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7107 states. [2019-01-13 03:46:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7107 to 6336. [2019-01-13 03:46:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6336 states. [2019-01-13 03:46:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 14276 transitions. [2019-01-13 03:46:36,063 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 14276 transitions. Word has length 93 [2019-01-13 03:46:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:36,063 INFO L480 AbstractCegarLoop]: Abstraction has 6336 states and 14276 transitions. [2019-01-13 03:46:36,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 14276 transitions. [2019-01-13 03:46:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:46:36,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:36,071 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] [2019-01-13 03:46:36,071 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:36,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:36,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1912562245, now seen corresponding path program 1 times [2019-01-13 03:46:36,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:36,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:36,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:36,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:36,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:36,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:36,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:36,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:36,204 INFO L87 Difference]: Start difference. First operand 6336 states and 14276 transitions. Second operand 4 states. [2019-01-13 03:46:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:36,325 INFO L93 Difference]: Finished difference Result 7454 states and 16666 transitions. [2019-01-13 03:46:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:46:36,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-13 03:46:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:36,336 INFO L225 Difference]: With dead ends: 7454 [2019-01-13 03:46:36,336 INFO L226 Difference]: Without dead ends: 7454 [2019-01-13 03:46:36,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7454 states. [2019-01-13 03:46:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7454 to 6583. [2019-01-13 03:46:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6583 states. [2019-01-13 03:46:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 14804 transitions. [2019-01-13 03:46:36,425 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 14804 transitions. Word has length 93 [2019-01-13 03:46:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:36,425 INFO L480 AbstractCegarLoop]: Abstraction has 6583 states and 14804 transitions. [2019-01-13 03:46:36,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 14804 transitions. [2019-01-13 03:46:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:36,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:36,436 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] [2019-01-13 03:46:36,437 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1767727250, now seen corresponding path program 1 times [2019-01-13 03:46:36,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:36,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:36,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:36,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:36,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:46:36,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:46:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:46:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:36,565 INFO L87 Difference]: Start difference. First operand 6583 states and 14804 transitions. Second operand 5 states. [2019-01-13 03:46:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:36,689 INFO L93 Difference]: Finished difference Result 7097 states and 15905 transitions. [2019-01-13 03:46:36,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:46:36,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-13 03:46:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:36,697 INFO L225 Difference]: With dead ends: 7097 [2019-01-13 03:46:36,698 INFO L226 Difference]: Without dead ends: 7097 [2019-01-13 03:46:36,698 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 [2019-01-13 03:46:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2019-01-13 03:46:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 5487. [2019-01-13 03:46:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2019-01-13 03:46:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 12342 transitions. [2019-01-13 03:46:36,759 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 12342 transitions. Word has length 95 [2019-01-13 03:46:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:36,760 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 12342 transitions. [2019-01-13 03:46:36,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:46:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 12342 transitions. [2019-01-13 03:46:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:36,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:36,768 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] [2019-01-13 03:46:36,768 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1756411123, now seen corresponding path program 1 times [2019-01-13 03:46:36,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:36,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:36,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:36,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:46:36,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:46:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:46:36,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:46:36,949 INFO L87 Difference]: Start difference. First operand 5487 states and 12342 transitions. Second operand 4 states. [2019-01-13 03:46:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:37,230 INFO L93 Difference]: Finished difference Result 7045 states and 15730 transitions. [2019-01-13 03:46:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:46:37,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-13 03:46:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:37,240 INFO L225 Difference]: With dead ends: 7045 [2019-01-13 03:46:37,240 INFO L226 Difference]: Without dead ends: 6978 [2019-01-13 03:46:37,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:46:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2019-01-13 03:46:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6544. [2019-01-13 03:46:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6544 states. [2019-01-13 03:46:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6544 states to 6544 states and 14673 transitions. [2019-01-13 03:46:37,309 INFO L78 Accepts]: Start accepts. Automaton has 6544 states and 14673 transitions. Word has length 95 [2019-01-13 03:46:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:37,309 INFO L480 AbstractCegarLoop]: Abstraction has 6544 states and 14673 transitions. [2019-01-13 03:46:37,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:46:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6544 states and 14673 transitions. [2019-01-13 03:46:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:37,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:37,317 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] [2019-01-13 03:46:37,317 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 461346830, now seen corresponding path program 1 times [2019-01-13 03:46:37,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:37,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:37,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:37,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:46:37,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:46:37,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:46:37,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:46:37,711 INFO L87 Difference]: Start difference. First operand 6544 states and 14673 transitions. Second operand 9 states. [2019-01-13 03:46:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:38,567 INFO L93 Difference]: Finished difference Result 8236 states and 18263 transitions. [2019-01-13 03:46:38,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:46:38,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-01-13 03:46:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:38,579 INFO L225 Difference]: With dead ends: 8236 [2019-01-13 03:46:38,580 INFO L226 Difference]: Without dead ends: 8236 [2019-01-13 03:46:38,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-01-13 03:46:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8236 states. [2019-01-13 03:46:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8236 to 7064. [2019-01-13 03:46:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7064 states. [2019-01-13 03:46:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7064 states to 7064 states and 15743 transitions. [2019-01-13 03:46:38,658 INFO L78 Accepts]: Start accepts. Automaton has 7064 states and 15743 transitions. Word has length 95 [2019-01-13 03:46:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:38,659 INFO L480 AbstractCegarLoop]: Abstraction has 7064 states and 15743 transitions. [2019-01-13 03:46:38,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:46:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7064 states and 15743 transitions. [2019-01-13 03:46:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:38,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:38,667 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] [2019-01-13 03:46:38,667 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash 672697743, now seen corresponding path program 1 times [2019-01-13 03:46:38,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:38,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:38,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:38,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:46:38,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:46:38,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:46:38,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:46:38,962 INFO L87 Difference]: Start difference. First operand 7064 states and 15743 transitions. Second operand 9 states. [2019-01-13 03:46:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:39,566 INFO L93 Difference]: Finished difference Result 8201 states and 18214 transitions. [2019-01-13 03:46:39,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 03:46:39,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-01-13 03:46:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:39,578 INFO L225 Difference]: With dead ends: 8201 [2019-01-13 03:46:39,578 INFO L226 Difference]: Without dead ends: 8114 [2019-01-13 03:46:39,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-01-13 03:46:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2019-01-13 03:46:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 6988. [2019-01-13 03:46:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6988 states. [2019-01-13 03:46:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 15579 transitions. [2019-01-13 03:46:39,663 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 15579 transitions. Word has length 95 [2019-01-13 03:46:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:39,663 INFO L480 AbstractCegarLoop]: Abstraction has 6988 states and 15579 transitions. [2019-01-13 03:46:39,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:46:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 15579 transitions. [2019-01-13 03:46:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:39,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:39,671 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] [2019-01-13 03:46:39,672 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1560201424, now seen corresponding path program 1 times [2019-01-13 03:46:39,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:39,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:39,982 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:46:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:40,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:40,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:46:40,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:46:40,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:46:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:46:40,124 INFO L87 Difference]: Start difference. First operand 6988 states and 15579 transitions. Second operand 11 states. [2019-01-13 03:46:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:41,924 INFO L93 Difference]: Finished difference Result 13014 states and 29142 transitions. [2019-01-13 03:46:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:46:41,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-01-13 03:46:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:41,937 INFO L225 Difference]: With dead ends: 13014 [2019-01-13 03:46:41,937 INFO L226 Difference]: Without dead ends: 9019 [2019-01-13 03:46:41,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 03:46:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2019-01-13 03:46:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 6813. [2019-01-13 03:46:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6813 states. [2019-01-13 03:46:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6813 states to 6813 states and 15151 transitions. [2019-01-13 03:46:42,016 INFO L78 Accepts]: Start accepts. Automaton has 6813 states and 15151 transitions. Word has length 95 [2019-01-13 03:46:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:42,016 INFO L480 AbstractCegarLoop]: Abstraction has 6813 states and 15151 transitions. [2019-01-13 03:46:42,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:46:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6813 states and 15151 transitions. [2019-01-13 03:46:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:42,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:42,024 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] [2019-01-13 03:46:42,024 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1172529568, now seen corresponding path program 1 times [2019-01-13 03:46:42,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:42,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:42,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:42,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:42,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:42,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:46:42,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:46:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:46:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:42,208 INFO L87 Difference]: Start difference. First operand 6813 states and 15151 transitions. Second operand 7 states. [2019-01-13 03:46:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:42,928 INFO L93 Difference]: Finished difference Result 8440 states and 18539 transitions. [2019-01-13 03:46:42,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:46:42,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:46:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:42,940 INFO L225 Difference]: With dead ends: 8440 [2019-01-13 03:46:42,940 INFO L226 Difference]: Without dead ends: 8402 [2019-01-13 03:46:42,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:46:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2019-01-13 03:46:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 7205. [2019-01-13 03:46:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7205 states. [2019-01-13 03:46:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7205 states to 7205 states and 15910 transitions. [2019-01-13 03:46:43,020 INFO L78 Accepts]: Start accepts. Automaton has 7205 states and 15910 transitions. Word has length 95 [2019-01-13 03:46:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:43,020 INFO L480 AbstractCegarLoop]: Abstraction has 7205 states and 15910 transitions. [2019-01-13 03:46:43,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:46:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 7205 states and 15910 transitions. [2019-01-13 03:46:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:43,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:43,028 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] [2019-01-13 03:46:43,028 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash -354392864, now seen corresponding path program 2 times [2019-01-13 03:46:43,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:43,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:43,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:46:43,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:46:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:46:43,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:46:43,321 INFO L87 Difference]: Start difference. First operand 7205 states and 15910 transitions. Second operand 9 states. [2019-01-13 03:46:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:44,006 INFO L93 Difference]: Finished difference Result 8405 states and 18498 transitions. [2019-01-13 03:46:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:46:44,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-01-13 03:46:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:44,017 INFO L225 Difference]: With dead ends: 8405 [2019-01-13 03:46:44,017 INFO L226 Difference]: Without dead ends: 8398 [2019-01-13 03:46:44,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:46:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8398 states. [2019-01-13 03:46:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8398 to 7381. [2019-01-13 03:46:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7381 states. [2019-01-13 03:46:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 16326 transitions. [2019-01-13 03:46:44,100 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 16326 transitions. Word has length 95 [2019-01-13 03:46:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:44,100 INFO L480 AbstractCegarLoop]: Abstraction has 7381 states and 16326 transitions. [2019-01-13 03:46:44,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:46:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 16326 transitions. [2019-01-13 03:46:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:44,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:44,108 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] [2019-01-13 03:46:44,109 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:44,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:44,109 INFO L82 PathProgramCache]: Analyzing trace with hash -143041951, now seen corresponding path program 1 times [2019-01-13 03:46:44,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:44,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:44,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:44,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:46:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:44,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:44,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:46:44,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:46:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:46:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:46:44,293 INFO L87 Difference]: Start difference. First operand 7381 states and 16326 transitions. Second operand 7 states. [2019-01-13 03:46:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:44,772 INFO L93 Difference]: Finished difference Result 9123 states and 20063 transitions. [2019-01-13 03:46:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:46:44,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:46:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:44,784 INFO L225 Difference]: With dead ends: 9123 [2019-01-13 03:46:44,784 INFO L226 Difference]: Without dead ends: 9123 [2019-01-13 03:46:44,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:46:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2019-01-13 03:46:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 7471. [2019-01-13 03:46:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7471 states. [2019-01-13 03:46:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7471 states to 7471 states and 16546 transitions. [2019-01-13 03:46:44,865 INFO L78 Accepts]: Start accepts. Automaton has 7471 states and 16546 transitions. Word has length 95 [2019-01-13 03:46:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:44,865 INFO L480 AbstractCegarLoop]: Abstraction has 7471 states and 16546 transitions. [2019-01-13 03:46:44,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:46:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 7471 states and 16546 transitions. [2019-01-13 03:46:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:44,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:44,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:46:44,873 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash -842763807, now seen corresponding path program 1 times [2019-01-13 03:46:44,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:44,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:46:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:46:45,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:46:45,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:46:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:46:45,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:46:45,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:46:45,206 INFO L87 Difference]: Start difference. First operand 7471 states and 16546 transitions. Second operand 8 states. [2019-01-13 03:46:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:46:45,900 INFO L93 Difference]: Finished difference Result 9523 states and 20956 transitions. [2019-01-13 03:46:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:46:45,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:46:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:46:45,916 INFO L225 Difference]: With dead ends: 9523 [2019-01-13 03:46:45,916 INFO L226 Difference]: Without dead ends: 9523 [2019-01-13 03:46:45,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:46:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2019-01-13 03:46:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 7646. [2019-01-13 03:46:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7646 states. [2019-01-13 03:46:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7646 states to 7646 states and 16951 transitions. [2019-01-13 03:46:46,022 INFO L78 Accepts]: Start accepts. Automaton has 7646 states and 16951 transitions. Word has length 95 [2019-01-13 03:46:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:46:46,022 INFO L480 AbstractCegarLoop]: Abstraction has 7646 states and 16951 transitions. [2019-01-13 03:46:46,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:46:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7646 states and 16951 transitions. [2019-01-13 03:46:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:46:46,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:46:46,032 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] [2019-01-13 03:46:46,032 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:46:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:46:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -631412894, now seen corresponding path program 2 times [2019-01-13 03:46:46,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:46:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:46:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:46,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:46:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:46:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:46:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:46:46,128 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:46:46,320 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:46:46,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:46:46 BasicIcfg [2019-01-13 03:46:46,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:46:46,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:46:46,323 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:46:46,323 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:46:46,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:46:02" (3/4) ... [2019-01-13 03:46:46,331 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:46:46,559 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:46:46,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:46:46,561 INFO L168 Benchmark]: Toolchain (without parser) took 46580.12 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 943.3 MB in the beginning and 1.7 GB in the end (delta: -739.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-13 03:46:46,563 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:46:46,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-13 03:46:46,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:46:46,567 INFO L168 Benchmark]: Boogie Preprocessor took 44.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:46:46,568 INFO L168 Benchmark]: RCFGBuilder took 1153.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-01-13 03:46:46,568 INFO L168 Benchmark]: TraceAbstraction took 44261.64 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -666.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-13 03:46:46,569 INFO L168 Benchmark]: Witness Printer took 236.46 ms. Allocated memory is still 3.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:46:46,584 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 818.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1153.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44261.64 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -666.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 236.46 ms. Allocated memory is still 3.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t1709; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t1709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1710; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 44.0s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8919 SDtfs, 10537 SDslu, 20700 SDs, 0 SdLazy, 9959 SolverSat, 456 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 78 SyntacticMatches, 37 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=15, 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: 9.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 83935 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2310 ConstructedInterpolants, 0 QuantifiedInterpolants, 509685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...