./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi010_pso.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/rfi010_pso.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 46d15676297641b1bbddbc888fde8bc988df789f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:59:53,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:59:53,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:59:53,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:59:53,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:59:53,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:59:53,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:59:53,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:59:53,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:59:53,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:59:53,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:59:53,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:59:53,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:59:53,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:59:53,822 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:59:53,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:59:53,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:59:53,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:59:53,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:59:53,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:59:53,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:59:53,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:59:53,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:59:53,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:59:53,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:59:53,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:59:53,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:59:53,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:59:53,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:59:53,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:59:53,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:59:53,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:59:53,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:59:53,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:59:53,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:59:53,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:59:53,860 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:59:53,882 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:59:53,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:59:53,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:59:53,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:59:53,884 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:59:53,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:59:53,884 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:59:53,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:59:53,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:59:53,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:59:53,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:59:53,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:59:53,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:59:53,886 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:59:53,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:59:53,887 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:59:53,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:59:53,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:59:53,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:59:53,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:59:53,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:59:53,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:59:53,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:59:53,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:59:53,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:59:53,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:59:53,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:59:53,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:59:53,890 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 -> 46d15676297641b1bbddbc888fde8bc988df789f [2019-01-13 03:59:53,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:59:53,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:59:53,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:59:53,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:59:53,984 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:59:53,985 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi010_pso.opt_false-unreach-call.i [2019-01-13 03:59:54,042 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d72d534c7/1e010e01ad8146ef80710521e2d0c514/FLAG0a6f73a35 [2019-01-13 03:59:54,585 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:59:54,585 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi010_pso.opt_false-unreach-call.i [2019-01-13 03:59:54,607 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d72d534c7/1e010e01ad8146ef80710521e2d0c514/FLAG0a6f73a35 [2019-01-13 03:59:54,820 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d72d534c7/1e010e01ad8146ef80710521e2d0c514 [2019-01-13 03:59:54,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:59:54,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:59:54,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:59:54,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:59:54,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:59:54,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:59:54" (1/1) ... [2019-01-13 03:59:54,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c23ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:54, skipping insertion in model container [2019-01-13 03:59:54,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:59:54" (1/1) ... [2019-01-13 03:59:54,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:59:54,922 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:59:55,497 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:59:55,522 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:59:55,702 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:59:55,801 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:59:55,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55 WrapperNode [2019-01-13 03:59:55,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:59:55,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:59:55,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:59:55,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:59:55,814 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:59:55" (1/1) ... [2019-01-13 03:59:55,857 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:59:55" (1/1) ... [2019-01-13 03:59:55,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:59:55,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:59:55,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:59:55,898 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:59:55,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (1/1) ... [2019-01-13 03:59:55,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:59:55,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:59:55,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:59:55,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:59:55,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (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:59:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:59:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:59:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:59:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:59:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:59:56,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:59:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:59:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:59:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:59:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:59:56,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:59:56,005 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:59:57,299 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:59:57,300 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:59:57,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:59:57 BoogieIcfgContainer [2019-01-13 03:59:57,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:59:57,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:59:57,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:59:57,306 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:59:57,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:59:54" (1/3) ... [2019-01-13 03:59:57,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1ecd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:59:57, skipping insertion in model container [2019-01-13 03:59:57,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:59:55" (2/3) ... [2019-01-13 03:59:57,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1ecd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:59:57, skipping insertion in model container [2019-01-13 03:59:57,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:59:57" (3/3) ... [2019-01-13 03:59:57,310 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_pso.opt_false-unreach-call.i [2019-01-13 03:59:57,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,362 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,363 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,383 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,383 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,384 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,384 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,384 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:59:57,442 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:59:57,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:59:57,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:59:57,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:59:57,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:59:57,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:59:57,495 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:59:57,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:59:57,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:59:57,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:59:57,495 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:59:57,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:59:57,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:59:57,516 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2019-01-13 04:00:06,175 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2019-01-13 04:00:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2019-01-13 04:00:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 04:00:06,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:06,188 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] [2019-01-13 04:00:06,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2019-01-13 04:00:06,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:00:06,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:06,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:00:06,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:00:06,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:00:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:00:06,606 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2019-01-13 04:00:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:08,713 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2019-01-13 04:00:08,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:00:08,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-13 04:00:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:09,456 INFO L225 Difference]: With dead ends: 150583 [2019-01-13 04:00:09,456 INFO L226 Difference]: Without dead ends: 105839 [2019-01-13 04:00:09,459 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 04:00:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2019-01-13 04:00:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2019-01-13 04:00:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2019-01-13 04:00:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2019-01-13 04:00:14,738 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2019-01-13 04:00:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:14,741 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2019-01-13 04:00:14,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:00:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2019-01-13 04:00:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 04:00:14,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:14,758 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 04:00:14,758 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:14,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:14,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2019-01-13 04:00:14,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:14,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:14,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:14,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:00:14,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:14,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:00:14,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:00:14,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:00:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:00:14,970 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2019-01-13 04:00:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:18,132 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2019-01-13 04:00:18,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:00:18,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 04:00:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:18,742 INFO L225 Difference]: With dead ends: 146039 [2019-01-13 04:00:18,742 INFO L226 Difference]: Without dead ends: 145471 [2019-01-13 04:00:18,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:00:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2019-01-13 04:00:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2019-01-13 04:00:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2019-01-13 04:00:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2019-01-13 04:00:27,643 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2019-01-13 04:00:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:27,645 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2019-01-13 04:00:27,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:00:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2019-01-13 04:00:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 04:00:27,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:27,653 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] [2019-01-13 04:00:27,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash 136646938, now seen corresponding path program 1 times [2019-01-13 04:00:27,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:27,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:27,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:00:27,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:27,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:00:27,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:00:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:00:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:00:27,790 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2019-01-13 04:00:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:30,807 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2019-01-13 04:00:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:00:30,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 04:00:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:31,679 INFO L225 Difference]: With dead ends: 199269 [2019-01-13 04:00:31,680 INFO L226 Difference]: Without dead ends: 198805 [2019-01-13 04:00:31,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:00:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2019-01-13 04:00:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2019-01-13 04:00:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2019-01-13 04:00:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2019-01-13 04:00:37,290 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2019-01-13 04:00:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:37,291 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2019-01-13 04:00:37,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:00:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2019-01-13 04:00:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 04:00:37,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:37,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:00:37,303 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -943699264, now seen corresponding path program 1 times [2019-01-13 04:00:37,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:37,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:37,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:00:37,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:37,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:00:37,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:00:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:00:37,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:00:37,413 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2019-01-13 04:00:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:38,317 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2019-01-13 04:00:38,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:00:38,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-13 04:00:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:38,821 INFO L225 Difference]: With dead ends: 179115 [2019-01-13 04:00:38,821 INFO L226 Difference]: Without dead ends: 179115 [2019-01-13 04:00:38,822 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 04:00:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2019-01-13 04:00:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2019-01-13 04:00:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2019-01-13 04:00:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2019-01-13 04:00:49,283 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2019-01-13 04:00:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:49,283 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2019-01-13 04:00:49,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:00:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2019-01-13 04:00:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 04:00:49,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:49,311 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] [2019-01-13 04:00:49,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2019-01-13 04:00:49,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:49,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:00:49,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:49,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:00:49,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:00:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:00:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:00:49,495 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2019-01-13 04:00:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:53,545 INFO L93 Difference]: Finished difference Result 214598 states and 788311 transitions. [2019-01-13 04:00:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:00:53,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 04:00:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:54,207 INFO L225 Difference]: With dead ends: 214598 [2019-01-13 04:00:54,207 INFO L226 Difference]: Without dead ends: 214598 [2019-01-13 04:00:54,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:00:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214598 states. [2019-01-13 04:01:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214598 to 200128. [2019-01-13 04:01:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200128 states. [2019-01-13 04:01:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200128 states to 200128 states and 735197 transitions. [2019-01-13 04:01:01,496 INFO L78 Accepts]: Start accepts. Automaton has 200128 states and 735197 transitions. Word has length 53 [2019-01-13 04:01:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:01,496 INFO L480 AbstractCegarLoop]: Abstraction has 200128 states and 735197 transitions. [2019-01-13 04:01:01,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 200128 states and 735197 transitions. [2019-01-13 04:01:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 04:01:01,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:01,526 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] [2019-01-13 04:01:01,526 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2019-01-13 04:01:01,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:01,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:01,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:01,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:01,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:01,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:01,966 INFO L87 Difference]: Start difference. First operand 200128 states and 735197 transitions. Second operand 7 states. [2019-01-13 04:01:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:05,189 INFO L93 Difference]: Finished difference Result 283834 states and 1009167 transitions. [2019-01-13 04:01:05,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:01:05,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-13 04:01:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:06,029 INFO L225 Difference]: With dead ends: 283834 [2019-01-13 04:01:06,029 INFO L226 Difference]: Without dead ends: 283834 [2019-01-13 04:01:06,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 04:01:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283834 states. [2019-01-13 04:01:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283834 to 228356. [2019-01-13 04:01:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228356 states. [2019-01-13 04:01:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228356 states to 228356 states and 826700 transitions. [2019-01-13 04:01:21,061 INFO L78 Accepts]: Start accepts. Automaton has 228356 states and 826700 transitions. Word has length 53 [2019-01-13 04:01:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:21,061 INFO L480 AbstractCegarLoop]: Abstraction has 228356 states and 826700 transitions. [2019-01-13 04:01:21,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 228356 states and 826700 transitions. [2019-01-13 04:01:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 04:01:21,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:21,088 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] [2019-01-13 04:01:21,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2019-01-13 04:01:21,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:21,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:21,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:21,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:21,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:21,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:21,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:21,273 INFO L87 Difference]: Start difference. First operand 228356 states and 826700 transitions. Second operand 4 states. [2019-01-13 04:01:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:21,564 INFO L93 Difference]: Finished difference Result 38827 states and 123113 transitions. [2019-01-13 04:01:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:21,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-13 04:01:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:21,637 INFO L225 Difference]: With dead ends: 38827 [2019-01-13 04:01:21,637 INFO L226 Difference]: Without dead ends: 32376 [2019-01-13 04:01:21,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32376 states. [2019-01-13 04:01:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32376 to 32135. [2019-01-13 04:01:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32135 states. [2019-01-13 04:01:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32135 states to 32135 states and 100387 transitions. [2019-01-13 04:01:23,734 INFO L78 Accepts]: Start accepts. Automaton has 32135 states and 100387 transitions. Word has length 53 [2019-01-13 04:01:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:23,735 INFO L480 AbstractCegarLoop]: Abstraction has 32135 states and 100387 transitions. [2019-01-13 04:01:23,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 32135 states and 100387 transitions. [2019-01-13 04:01:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 04:01:23,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:23,738 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] [2019-01-13 04:01:23,738 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1658594805, now seen corresponding path program 1 times [2019-01-13 04:01:23,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:23,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:23,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:23,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:23,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:01:23,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:01:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:01:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:23,853 INFO L87 Difference]: Start difference. First operand 32135 states and 100387 transitions. Second operand 6 states. [2019-01-13 04:01:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:24,863 INFO L93 Difference]: Finished difference Result 42537 states and 131570 transitions. [2019-01-13 04:01:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 04:01:24,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 04:01:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:24,958 INFO L225 Difference]: With dead ends: 42537 [2019-01-13 04:01:24,958 INFO L226 Difference]: Without dead ends: 42440 [2019-01-13 04:01:24,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:01:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42440 states. [2019-01-13 04:01:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42440 to 31836. [2019-01-13 04:01:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2019-01-13 04:01:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 99515 transitions. [2019-01-13 04:01:25,586 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 99515 transitions. Word has length 53 [2019-01-13 04:01:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:25,587 INFO L480 AbstractCegarLoop]: Abstraction has 31836 states and 99515 transitions. [2019-01-13 04:01:25,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 99515 transitions. [2019-01-13 04:01:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-13 04:01:25,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:25,595 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] [2019-01-13 04:01:25,595 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 228917533, now seen corresponding path program 1 times [2019-01-13 04:01:25,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:25,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:25,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:25,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:25,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:25,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:25,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:25,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:25,691 INFO L87 Difference]: Start difference. First operand 31836 states and 99515 transitions. Second operand 4 states. [2019-01-13 04:01:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:26,058 INFO L93 Difference]: Finished difference Result 41208 states and 129949 transitions. [2019-01-13 04:01:26,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:26,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-13 04:01:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:26,143 INFO L225 Difference]: With dead ends: 41208 [2019-01-13 04:01:26,143 INFO L226 Difference]: Without dead ends: 41208 [2019-01-13 04:01:26,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41208 states. [2019-01-13 04:01:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41208 to 35932. [2019-01-13 04:01:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35932 states. [2019-01-13 04:01:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35932 states to 35932 states and 112644 transitions. [2019-01-13 04:01:26,732 INFO L78 Accepts]: Start accepts. Automaton has 35932 states and 112644 transitions. Word has length 63 [2019-01-13 04:01:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:26,733 INFO L480 AbstractCegarLoop]: Abstraction has 35932 states and 112644 transitions. [2019-01-13 04:01:26,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 35932 states and 112644 transitions. [2019-01-13 04:01:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-13 04:01:26,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:26,742 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] [2019-01-13 04:01:26,743 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1971727868, now seen corresponding path program 1 times [2019-01-13 04:01:26,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:26,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:26,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:01:26,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:01:26,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:01:26,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:26,909 INFO L87 Difference]: Start difference. First operand 35932 states and 112644 transitions. Second operand 6 states. [2019-01-13 04:01:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:29,193 INFO L93 Difference]: Finished difference Result 72509 states and 225560 transitions. [2019-01-13 04:01:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 04:01:29,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-01-13 04:01:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:29,329 INFO L225 Difference]: With dead ends: 72509 [2019-01-13 04:01:29,329 INFO L226 Difference]: Without dead ends: 72445 [2019-01-13 04:01:29,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:01:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72445 states. [2019-01-13 04:01:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72445 to 40892. [2019-01-13 04:01:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40892 states. [2019-01-13 04:01:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40892 states to 40892 states and 126622 transitions. [2019-01-13 04:01:30,147 INFO L78 Accepts]: Start accepts. Automaton has 40892 states and 126622 transitions. Word has length 63 [2019-01-13 04:01:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:30,147 INFO L480 AbstractCegarLoop]: Abstraction has 40892 states and 126622 transitions. [2019-01-13 04:01:30,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 40892 states and 126622 transitions. [2019-01-13 04:01:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 04:01:30,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:30,166 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] [2019-01-13 04:01:30,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash -203492115, now seen corresponding path program 1 times [2019-01-13 04:01:30,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:30,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:30,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:30,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:30,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:01:30,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:01:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:01:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:01:30,250 INFO L87 Difference]: Start difference. First operand 40892 states and 126622 transitions. Second operand 3 states. [2019-01-13 04:01:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:31,146 INFO L93 Difference]: Finished difference Result 46897 states and 143099 transitions. [2019-01-13 04:01:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:01:31,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-13 04:01:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:31,282 INFO L225 Difference]: With dead ends: 46897 [2019-01-13 04:01:31,282 INFO L226 Difference]: Without dead ends: 46897 [2019-01-13 04:01:31,283 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 04:01:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2019-01-13 04:01:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 40580. [2019-01-13 04:01:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40580 states. [2019-01-13 04:01:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 123024 transitions. [2019-01-13 04:01:32,078 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 123024 transitions. Word has length 69 [2019-01-13 04:01:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:32,078 INFO L480 AbstractCegarLoop]: Abstraction has 40580 states and 123024 transitions. [2019-01-13 04:01:32,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:01:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 123024 transitions. [2019-01-13 04:01:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 04:01:32,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:32,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:32,097 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash -229334547, now seen corresponding path program 1 times [2019-01-13 04:01:32,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:32,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:32,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:32,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:32,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:32,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:32,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:32,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:32,274 INFO L87 Difference]: Start difference. First operand 40580 states and 123024 transitions. Second operand 7 states. [2019-01-13 04:01:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:33,955 INFO L93 Difference]: Finished difference Result 56545 states and 170864 transitions. [2019-01-13 04:01:33,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 04:01:33,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-01-13 04:01:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:34,057 INFO L225 Difference]: With dead ends: 56545 [2019-01-13 04:01:34,057 INFO L226 Difference]: Without dead ends: 56241 [2019-01-13 04:01:34,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 04:01:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56241 states. [2019-01-13 04:01:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56241 to 47672. [2019-01-13 04:01:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2019-01-13 04:01:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2019-01-13 04:01:35,118 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2019-01-13 04:01:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:35,118 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2019-01-13 04:01:35,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2019-01-13 04:01:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 04:01:35,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:35,137 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] [2019-01-13 04:01:35,137 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2026285906, now seen corresponding path program 1 times [2019-01-13 04:01:35,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:35,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:01:35,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:01:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:01:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:35,307 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2019-01-13 04:01:36,645 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-13 04:01:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:37,931 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2019-01-13 04:01:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:01:37,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-01-13 04:01:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:38,040 INFO L225 Difference]: With dead ends: 57838 [2019-01-13 04:01:38,040 INFO L226 Difference]: Without dead ends: 57838 [2019-01-13 04:01:38,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:01:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2019-01-13 04:01:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2019-01-13 04:01:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2019-01-13 04:01:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2019-01-13 04:01:38,860 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2019-01-13 04:01:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:38,860 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2019-01-13 04:01:38,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:01:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2019-01-13 04:01:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 04:01:38,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:38,878 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] [2019-01-13 04:01:38,878 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1138782225, now seen corresponding path program 1 times [2019-01-13 04:01:38,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:38,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:39,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:39,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:39,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:39,062 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2019-01-13 04:01:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:39,155 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2019-01-13 04:01:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:01:39,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 04:01:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:39,173 INFO L225 Difference]: With dead ends: 13236 [2019-01-13 04:01:39,174 INFO L226 Difference]: Without dead ends: 11116 [2019-01-13 04:01:39,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2019-01-13 04:01:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2019-01-13 04:01:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2019-01-13 04:01:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2019-01-13 04:01:39,299 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2019-01-13 04:01:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:39,299 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2019-01-13 04:01:39,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2019-01-13 04:01:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-13 04:01:39,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:39,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:39,309 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1758043612, now seen corresponding path program 1 times [2019-01-13 04:01:39,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:39,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:39,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:39,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:39,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:39,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:39,467 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2019-01-13 04:01:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:39,747 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2019-01-13 04:01:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:01:39,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-13 04:01:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:39,764 INFO L225 Difference]: With dead ends: 9960 [2019-01-13 04:01:39,764 INFO L226 Difference]: Without dead ends: 9960 [2019-01-13 04:01:39,765 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 04:01:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2019-01-13 04:01:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2019-01-13 04:01:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-01-13 04:01:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2019-01-13 04:01:39,885 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2019-01-13 04:01:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:39,886 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2019-01-13 04:01:39,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2019-01-13 04:01:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-13 04:01:39,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:39,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:39,900 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash -319165731, now seen corresponding path program 1 times [2019-01-13 04:01:39,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:39,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:39,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:40,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:40,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:01:40,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:01:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:01:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:01:40,019 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 3 states. [2019-01-13 04:01:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:40,419 INFO L93 Difference]: Finished difference Result 12725 states and 30850 transitions. [2019-01-13 04:01:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:01:40,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-13 04:01:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:40,438 INFO L225 Difference]: With dead ends: 12725 [2019-01-13 04:01:40,438 INFO L226 Difference]: Without dead ends: 12725 [2019-01-13 04:01:40,439 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 04:01:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12725 states. [2019-01-13 04:01:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12725 to 11524. [2019-01-13 04:01:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11524 states. [2019-01-13 04:01:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11524 states to 11524 states and 28181 transitions. [2019-01-13 04:01:40,579 INFO L78 Accepts]: Start accepts. Automaton has 11524 states and 28181 transitions. Word has length 98 [2019-01-13 04:01:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:40,580 INFO L480 AbstractCegarLoop]: Abstraction has 11524 states and 28181 transitions. [2019-01-13 04:01:40,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:01:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11524 states and 28181 transitions. [2019-01-13 04:01:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-13 04:01:40,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:40,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:40,593 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1211430317, now seen corresponding path program 2 times [2019-01-13 04:01:40,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:40,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:40,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:40,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:01:40,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:01:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:01:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:40,827 INFO L87 Difference]: Start difference. First operand 11524 states and 28181 transitions. Second operand 6 states. [2019-01-13 04:01:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:41,444 INFO L93 Difference]: Finished difference Result 14264 states and 34204 transitions. [2019-01-13 04:01:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:01:41,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-13 04:01:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:41,465 INFO L225 Difference]: With dead ends: 14264 [2019-01-13 04:01:41,465 INFO L226 Difference]: Without dead ends: 14264 [2019-01-13 04:01:41,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2019-01-13 04:01:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 11317. [2019-01-13 04:01:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2019-01-13 04:01:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 27219 transitions. [2019-01-13 04:01:41,616 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 27219 transitions. Word has length 98 [2019-01-13 04:01:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:41,617 INFO L480 AbstractCegarLoop]: Abstraction has 11317 states and 27219 transitions. [2019-01-13 04:01:41,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 27219 transitions. [2019-01-13 04:01:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:41,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:41,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:41,631 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1858179817, now seen corresponding path program 1 times [2019-01-13 04:01:41,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:41,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:01:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:41,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:41,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:01:41,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:01:41,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:01:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:41,855 INFO L87 Difference]: Start difference. First operand 11317 states and 27219 transitions. Second operand 6 states. [2019-01-13 04:01:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:42,311 INFO L93 Difference]: Finished difference Result 13695 states and 32744 transitions. [2019-01-13 04:01:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:42,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-01-13 04:01:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:42,331 INFO L225 Difference]: With dead ends: 13695 [2019-01-13 04:01:42,332 INFO L226 Difference]: Without dead ends: 13663 [2019-01-13 04:01:42,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2019-01-13 04:01:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 12238. [2019-01-13 04:01:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12238 states. [2019-01-13 04:01:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12238 states to 12238 states and 29366 transitions. [2019-01-13 04:01:42,495 INFO L78 Accepts]: Start accepts. Automaton has 12238 states and 29366 transitions. Word has length 100 [2019-01-13 04:01:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:42,496 INFO L480 AbstractCegarLoop]: Abstraction has 12238 states and 29366 transitions. [2019-01-13 04:01:42,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12238 states and 29366 transitions. [2019-01-13 04:01:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:42,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:42,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:42,511 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash 61228458, now seen corresponding path program 1 times [2019-01-13 04:01:42,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:42,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:42,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:42,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:42,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:42,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:42,794 INFO L87 Difference]: Start difference. First operand 12238 states and 29366 transitions. Second operand 7 states. [2019-01-13 04:01:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:43,687 INFO L93 Difference]: Finished difference Result 18053 states and 43645 transitions. [2019-01-13 04:01:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:01:43,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-01-13 04:01:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:43,711 INFO L225 Difference]: With dead ends: 18053 [2019-01-13 04:01:43,712 INFO L226 Difference]: Without dead ends: 18053 [2019-01-13 04:01:43,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:01:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2019-01-13 04:01:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 12767. [2019-01-13 04:01:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2019-01-13 04:01:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 30777 transitions. [2019-01-13 04:01:43,895 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 30777 transitions. Word has length 100 [2019-01-13 04:01:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:43,895 INFO L480 AbstractCegarLoop]: Abstraction has 12767 states and 30777 transitions. [2019-01-13 04:01:43,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 30777 transitions. [2019-01-13 04:01:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:43,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:43,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:43,910 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:43,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 948732139, now seen corresponding path program 1 times [2019-01-13 04:01:43,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:43,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:44,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:44,140 INFO L87 Difference]: Start difference. First operand 12767 states and 30777 transitions. Second operand 7 states. [2019-01-13 04:01:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:44,436 INFO L93 Difference]: Finished difference Result 16664 states and 40307 transitions. [2019-01-13 04:01:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:44,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-01-13 04:01:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:44,457 INFO L225 Difference]: With dead ends: 16664 [2019-01-13 04:01:44,457 INFO L226 Difference]: Without dead ends: 16664 [2019-01-13 04:01:44,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16664 states. [2019-01-13 04:01:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16664 to 13890. [2019-01-13 04:01:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13890 states. [2019-01-13 04:01:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13890 states to 13890 states and 33546 transitions. [2019-01-13 04:01:44,637 INFO L78 Accepts]: Start accepts. Automaton has 13890 states and 33546 transitions. Word has length 100 [2019-01-13 04:01:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:44,638 INFO L480 AbstractCegarLoop]: Abstraction has 13890 states and 33546 transitions. [2019-01-13 04:01:44,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13890 states and 33546 transitions. [2019-01-13 04:01:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:44,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:44,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:44,651 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:44,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:44,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1976827831, now seen corresponding path program 1 times [2019-01-13 04:01:44,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:44,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:44,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:44,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:44,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:01:44,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:01:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:01:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:44,890 INFO L87 Difference]: Start difference. First operand 13890 states and 33546 transitions. Second operand 6 states. [2019-01-13 04:01:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:45,106 INFO L93 Difference]: Finished difference Result 13618 states and 32594 transitions. [2019-01-13 04:01:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:45,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-01-13 04:01:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:45,124 INFO L225 Difference]: With dead ends: 13618 [2019-01-13 04:01:45,124 INFO L226 Difference]: Without dead ends: 13618 [2019-01-13 04:01:45,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13618 states. [2019-01-13 04:01:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13618 to 10725. [2019-01-13 04:01:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10725 states. [2019-01-13 04:01:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10725 states to 10725 states and 25876 transitions. [2019-01-13 04:01:45,265 INFO L78 Accepts]: Start accepts. Automaton has 10725 states and 25876 transitions. Word has length 100 [2019-01-13 04:01:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:45,265 INFO L480 AbstractCegarLoop]: Abstraction has 10725 states and 25876 transitions. [2019-01-13 04:01:45,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 10725 states and 25876 transitions. [2019-01-13 04:01:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:45,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:45,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:45,277 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash -22235627, now seen corresponding path program 1 times [2019-01-13 04:01:45,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:45,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:45,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:45,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:45,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:45,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:45,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:45,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:45,583 INFO L87 Difference]: Start difference. First operand 10725 states and 25876 transitions. Second operand 5 states. [2019-01-13 04:01:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:45,889 INFO L93 Difference]: Finished difference Result 12621 states and 29866 transitions. [2019-01-13 04:01:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:01:45,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-13 04:01:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:45,907 INFO L225 Difference]: With dead ends: 12621 [2019-01-13 04:01:45,907 INFO L226 Difference]: Without dead ends: 12621 [2019-01-13 04:01:45,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12621 states. [2019-01-13 04:01:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12621 to 10898. [2019-01-13 04:01:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10898 states. [2019-01-13 04:01:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10898 states to 10898 states and 26245 transitions. [2019-01-13 04:01:46,048 INFO L78 Accepts]: Start accepts. Automaton has 10898 states and 26245 transitions. Word has length 100 [2019-01-13 04:01:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:46,048 INFO L480 AbstractCegarLoop]: Abstraction has 10898 states and 26245 transitions. [2019-01-13 04:01:46,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10898 states and 26245 transitions. [2019-01-13 04:01:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:46,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:46,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:46,061 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1444302318, now seen corresponding path program 1 times [2019-01-13 04:01:46,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:46,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:46,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:46,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:46,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:01:46,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:01:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:01:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:46,258 INFO L87 Difference]: Start difference. First operand 10898 states and 26245 transitions. Second operand 8 states. [2019-01-13 04:01:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:48,002 INFO L93 Difference]: Finished difference Result 19316 states and 45476 transitions. [2019-01-13 04:01:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 04:01:48,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-01-13 04:01:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:48,032 INFO L225 Difference]: With dead ends: 19316 [2019-01-13 04:01:48,032 INFO L226 Difference]: Without dead ends: 19221 [2019-01-13 04:01:48,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-01-13 04:01:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19221 states. [2019-01-13 04:01:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19221 to 14206. [2019-01-13 04:01:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14206 states. [2019-01-13 04:01:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14206 states to 14206 states and 34010 transitions. [2019-01-13 04:01:48,258 INFO L78 Accepts]: Start accepts. Automaton has 14206 states and 34010 transitions. Word has length 102 [2019-01-13 04:01:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:48,259 INFO L480 AbstractCegarLoop]: Abstraction has 14206 states and 34010 transitions. [2019-01-13 04:01:48,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:01:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14206 states and 34010 transitions. [2019-01-13 04:01:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:48,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:48,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:48,277 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash -632907025, now seen corresponding path program 1 times [2019-01-13 04:01:48,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:48,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:48,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:48,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:48,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:48,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:48,495 INFO L87 Difference]: Start difference. First operand 14206 states and 34010 transitions. Second operand 7 states. [2019-01-13 04:01:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:49,231 INFO L93 Difference]: Finished difference Result 18091 states and 41955 transitions. [2019-01-13 04:01:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 04:01:49,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-13 04:01:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:49,252 INFO L225 Difference]: With dead ends: 18091 [2019-01-13 04:01:49,253 INFO L226 Difference]: Without dead ends: 18091 [2019-01-13 04:01:49,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:01:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18091 states. [2019-01-13 04:01:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18091 to 15825. [2019-01-13 04:01:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15825 states. [2019-01-13 04:01:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15825 states to 15825 states and 37230 transitions. [2019-01-13 04:01:49,480 INFO L78 Accepts]: Start accepts. Automaton has 15825 states and 37230 transitions. Word has length 102 [2019-01-13 04:01:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:49,480 INFO L480 AbstractCegarLoop]: Abstraction has 15825 states and 37230 transitions. [2019-01-13 04:01:49,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15825 states and 37230 transitions. [2019-01-13 04:01:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:49,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:49,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:49,501 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -421556112, now seen corresponding path program 1 times [2019-01-13 04:01:49,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:49,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:49,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:49,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:49,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:49,829 INFO L87 Difference]: Start difference. First operand 15825 states and 37230 transitions. Second operand 7 states. [2019-01-13 04:01:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:50,206 INFO L93 Difference]: Finished difference Result 16499 states and 38703 transitions. [2019-01-13 04:01:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:01:50,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-13 04:01:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:50,229 INFO L225 Difference]: With dead ends: 16499 [2019-01-13 04:01:50,229 INFO L226 Difference]: Without dead ends: 16499 [2019-01-13 04:01:50,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 04:01:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16499 states. [2019-01-13 04:01:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16499 to 16352. [2019-01-13 04:01:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16352 states. [2019-01-13 04:01:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16352 states to 16352 states and 38410 transitions. [2019-01-13 04:01:50,417 INFO L78 Accepts]: Start accepts. Automaton has 16352 states and 38410 transitions. Word has length 102 [2019-01-13 04:01:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:50,417 INFO L480 AbstractCegarLoop]: Abstraction has 16352 states and 38410 transitions. [2019-01-13 04:01:50,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 16352 states and 38410 transitions. [2019-01-13 04:01:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:50,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:50,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:50,436 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash 465947569, now seen corresponding path program 1 times [2019-01-13 04:01:50,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:50,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:50,792 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 04:01:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:51,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:51,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 04:01:51,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 04:01:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 04:01:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:01:51,498 INFO L87 Difference]: Start difference. First operand 16352 states and 38410 transitions. Second operand 9 states. [2019-01-13 04:01:51,816 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-13 04:01:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:52,034 INFO L93 Difference]: Finished difference Result 20031 states and 47310 transitions. [2019-01-13 04:01:52,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:01:52,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-01-13 04:01:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:52,041 INFO L225 Difference]: With dead ends: 20031 [2019-01-13 04:01:52,041 INFO L226 Difference]: Without dead ends: 3872 [2019-01-13 04:01:52,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:01:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2019-01-13 04:01:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3870. [2019-01-13 04:01:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2019-01-13 04:01:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 9209 transitions. [2019-01-13 04:01:52,078 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 9209 transitions. Word has length 102 [2019-01-13 04:01:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:52,078 INFO L480 AbstractCegarLoop]: Abstraction has 3870 states and 9209 transitions. [2019-01-13 04:01:52,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 04:01:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 9209 transitions. [2019-01-13 04:01:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:52,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:52,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:52,083 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1339717430, now seen corresponding path program 1 times [2019-01-13 04:01:52,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:52,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:52,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:52,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:52,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:52,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:52,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:52,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:52,435 INFO L87 Difference]: Start difference. First operand 3870 states and 9209 transitions. Second operand 5 states. [2019-01-13 04:01:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:53,260 INFO L93 Difference]: Finished difference Result 4283 states and 10120 transitions. [2019-01-13 04:01:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:53,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-13 04:01:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:53,267 INFO L225 Difference]: With dead ends: 4283 [2019-01-13 04:01:53,267 INFO L226 Difference]: Without dead ends: 4259 [2019-01-13 04:01:53,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2019-01-13 04:01:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 3926. [2019-01-13 04:01:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2019-01-13 04:01:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 9334 transitions. [2019-01-13 04:01:53,314 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 9334 transitions. Word has length 102 [2019-01-13 04:01:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:53,314 INFO L480 AbstractCegarLoop]: Abstraction has 3926 states and 9334 transitions. [2019-01-13 04:01:53,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 9334 transitions. [2019-01-13 04:01:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:53,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:53,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:53,320 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1370737237, now seen corresponding path program 1 times [2019-01-13 04:01:53,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:53,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:54,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:54,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:54,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:54,053 INFO L87 Difference]: Start difference. First operand 3926 states and 9334 transitions. Second operand 7 states. [2019-01-13 04:01:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:54,424 INFO L93 Difference]: Finished difference Result 4337 states and 10192 transitions. [2019-01-13 04:01:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:54,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-13 04:01:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:54,431 INFO L225 Difference]: With dead ends: 4337 [2019-01-13 04:01:54,431 INFO L226 Difference]: Without dead ends: 4337 [2019-01-13 04:01:54,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-01-13 04:01:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 3868. [2019-01-13 04:01:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2019-01-13 04:01:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 9216 transitions. [2019-01-13 04:01:54,474 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 9216 transitions. Word has length 102 [2019-01-13 04:01:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:54,474 INFO L480 AbstractCegarLoop]: Abstraction has 3868 states and 9216 transitions. [2019-01-13 04:01:54,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 9216 transitions. [2019-01-13 04:01:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:54,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:54,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:54,479 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash 299428272, now seen corresponding path program 2 times [2019-01-13 04:01:54,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:54,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:54,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:54,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:54,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:54,929 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2019-01-13 04:01:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:54,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:54,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:54,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:54,949 INFO L87 Difference]: Start difference. First operand 3868 states and 9216 transitions. Second operand 5 states. [2019-01-13 04:01:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:54,991 INFO L93 Difference]: Finished difference Result 3868 states and 9200 transitions. [2019-01-13 04:01:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:54,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-13 04:01:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:54,998 INFO L225 Difference]: With dead ends: 3868 [2019-01-13 04:01:54,998 INFO L226 Difference]: Without dead ends: 3868 [2019-01-13 04:01:54,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-01-13 04:01:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3474. [2019-01-13 04:01:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3474 states. [2019-01-13 04:01:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 8288 transitions. [2019-01-13 04:01:55,035 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 8288 transitions. Word has length 102 [2019-01-13 04:01:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:55,036 INFO L480 AbstractCegarLoop]: Abstraction has 3474 states and 8288 transitions. [2019-01-13 04:01:55,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 8288 transitions. [2019-01-13 04:01:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:55,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:55,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:55,041 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1186931953, now seen corresponding path program 2 times [2019-01-13 04:01:55,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:55,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:55,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:01:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:01:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-13 04:01:55,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 04:01:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 04:01:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:01:55,310 INFO L87 Difference]: Start difference. First operand 3474 states and 8288 transitions. Second operand 13 states. [2019-01-13 04:01:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:56,195 INFO L93 Difference]: Finished difference Result 5354 states and 12513 transitions. [2019-01-13 04:01:56,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 04:01:56,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2019-01-13 04:01:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:56,202 INFO L225 Difference]: With dead ends: 5354 [2019-01-13 04:01:56,202 INFO L226 Difference]: Without dead ends: 3944 [2019-01-13 04:01:56,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-01-13 04:01:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2019-01-13 04:01:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3530. [2019-01-13 04:01:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3530 states. [2019-01-13 04:01:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 8350 transitions. [2019-01-13 04:01:56,238 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 8350 transitions. Word has length 102 [2019-01-13 04:01:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:56,238 INFO L480 AbstractCegarLoop]: Abstraction has 3530 states and 8350 transitions. [2019-01-13 04:01:56,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 04:01:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 8350 transitions. [2019-01-13 04:01:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:56,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:56,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:56,243 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1820697969, now seen corresponding path program 3 times [2019-01-13 04:01:56,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:56,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:56,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:01:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:01:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:01:56,328 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:01:56,510 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:01:56,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:01:56 BasicIcfg [2019-01-13 04:01:56,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:01:56,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:01:56,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:01:56,515 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:01:56,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:59:57" (3/4) ... [2019-01-13 04:01:56,520 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:01:56,676 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:01:56,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:01:56,677 INFO L168 Benchmark]: Toolchain (without parser) took 121853.52 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 952.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-01-13 04:01:56,678 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 04:01:56,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 976.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:56,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:56,681 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:01:56,681 INFO L168 Benchmark]: RCFGBuilder took 1361.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:56,681 INFO L168 Benchmark]: TraceAbstraction took 119209.85 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-01-13 04:01:56,682 INFO L168 Benchmark]: Witness Printer took 163.21 ms. Allocated memory is still 6.3 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:56,688 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 976.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.77 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 1361.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119209.85 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 163.21 ms. Allocated memory is still 6.3 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1769; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1770; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 119.0s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 39.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10978 SDtfs, 13414 SDslu, 28759 SDs, 0 SdLazy, 11028 SolverSat, 676 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 72 SyntacticMatches, 20 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228356occurred in iteration=6, 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: 61.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 369633 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2509 NumberOfCodeBlocks, 2509 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2377 ConstructedInterpolants, 0 QuantifiedInterpolants, 518581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...