./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix009_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e38c8c330a9981b6cf3f5b505fe1b87957b6fde ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12 23:18:51,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:18:51,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:18:51,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:18:51,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:18:51,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:18:51,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:18:51,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:18:51,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:18:51,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:18:51,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:18:51,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:18:51,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:18:51,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:18:51,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:18:51,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:18:51,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:18:51,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:18:51,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:18:51,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:18:51,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:18:51,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:18:51,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:18:51,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:18:51,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:18:51,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:18:51,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:18:51,949 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:18:51,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:18:51,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:18:51,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:18:51,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:18:51,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:18:51,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:18:51,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:18:51,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:18:51,956 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:18:51,973 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:18:51,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:18:51,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:18:51,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:18:51,975 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:18:51,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:18:51,975 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:18:51,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:18:51,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:18:51,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:18:51,977 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:18:51,977 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:18:51,977 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:18:51,978 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:18:51,978 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:18:51,978 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:18:51,978 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:18:51,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:18:51,979 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:18:51,980 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:18:51,980 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:18:51,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:18:51,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:18:51,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:18:51,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:18:51,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:18:51,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:18:51,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:18:51,982 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 -> 2e38c8c330a9981b6cf3f5b505fe1b87957b6fde [2019-01-12 23:18:52,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:18:52,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:18:52,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:18:52,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:18:52,038 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:18:52,038 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_pso.oepc_false-unreach-call.i [2019-01-12 23:18:52,096 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c2040e/419e80dc57cf4cb5bdbdb786784524ea/FLAGbbade9b03 [2019-01-12 23:18:52,661 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:18:52,661 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_pso.oepc_false-unreach-call.i [2019-01-12 23:18:52,677 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c2040e/419e80dc57cf4cb5bdbdb786784524ea/FLAGbbade9b03 [2019-01-12 23:18:52,936 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c2040e/419e80dc57cf4cb5bdbdb786784524ea [2019-01-12 23:18:52,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:18:52,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:18:52,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:18:52,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:18:52,951 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:18:52,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:18:52" (1/1) ... [2019-01-12 23:18:52,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d33055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:52, skipping insertion in model container [2019-01-12 23:18:52,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:18:52" (1/1) ... [2019-01-12 23:18:52,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:18:53,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:18:53,484 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:18:53,507 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:18:53,694 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:18:53,771 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:18:53,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53 WrapperNode [2019-01-12 23:18:53,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:18:53,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:18:53,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:18:53,773 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:18:53,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:18:53,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:18:53,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:18:53,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:18:53,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:18:53,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:18:53,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:18:53,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:18:53,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (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-12 23:18:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:18:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:18:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:18:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:18:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:18:53,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:18:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:18:53,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:18:53,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:18:53,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:18:53,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:18:53,968 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 23:18:55,086 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:18:55,087 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:18:55,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:18:55 BoogieIcfgContainer [2019-01-12 23:18:55,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:18:55,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:18:55,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:18:55,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:18:55,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:18:52" (1/3) ... [2019-01-12 23:18:55,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7096da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:18:55, skipping insertion in model container [2019-01-12 23:18:55,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53" (2/3) ... [2019-01-12 23:18:55,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7096da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:18:55, skipping insertion in model container [2019-01-12 23:18:55,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:18:55" (3/3) ... [2019-01-12 23:18:55,100 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc_false-unreach-call.i [2019-01-12 23:18:55,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,161 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,161 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,161 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,164 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,180 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,181 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:55,262 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:18:55,262 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:18:55,272 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:18:55,290 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:18:55,313 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:18:55,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:18:55,314 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:18:55,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:18:55,314 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:18:55,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:18:55,315 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:18:55,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:18:55,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:18:55,331 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2019-01-12 23:18:57,747 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2019-01-12 23:18:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2019-01-12 23:18:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 23:18:57,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:57,759 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] [2019-01-12 23:18:57,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2019-01-12 23:18:57,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:57,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:57,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:58,078 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-12 23:18:58,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:58,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:18:58,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:18:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:18:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:58,106 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2019-01-12 23:18:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:59,673 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2019-01-12 23:18:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:18:59,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 23:18:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:00,031 INFO L225 Difference]: With dead ends: 60793 [2019-01-12 23:19:00,031 INFO L226 Difference]: Without dead ends: 44273 [2019-01-12 23:19:00,033 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-12 23:19:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2019-01-12 23:19:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2019-01-12 23:19:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2019-01-12 23:19:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2019-01-12 23:19:01,983 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2019-01-12 23:19:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:01,984 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2019-01-12 23:19:01,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2019-01-12 23:19:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 23:19:01,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:01,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:01,994 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2019-01-12 23:19:01,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:02,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:02,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:02,136 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-12 23:19:02,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:02,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:02,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:02,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:02,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:02,139 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 5 states. [2019-01-12 23:19:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:05,308 INFO L93 Difference]: Finished difference Result 64007 states and 235337 transitions. [2019-01-12 23:19:05,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:19:05,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 23:19:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:06,257 INFO L225 Difference]: With dead ends: 64007 [2019-01-12 23:19:06,258 INFO L226 Difference]: Without dead ends: 63455 [2019-01-12 23:19:06,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:19:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63455 states. [2019-01-12 23:19:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63455 to 41423. [2019-01-12 23:19:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41423 states. [2019-01-12 23:19:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 152332 transitions. [2019-01-12 23:19:07,942 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 152332 transitions. Word has length 48 [2019-01-12 23:19:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:07,944 INFO L480 AbstractCegarLoop]: Abstraction has 41423 states and 152332 transitions. [2019-01-12 23:19:07,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 152332 transitions. [2019-01-12 23:19:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:19:07,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:07,954 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-12 23:19:07,954 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2019-01-12 23:19:07,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:07,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:08,321 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 23:19:08,361 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-12 23:19:08,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:08,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:08,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:08,363 INFO L87 Difference]: Start difference. First operand 41423 states and 152332 transitions. Second operand 6 states. [2019-01-12 23:19:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:09,855 INFO L93 Difference]: Finished difference Result 52773 states and 191027 transitions. [2019-01-12 23:19:09,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:19:09,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-01-12 23:19:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:10,056 INFO L225 Difference]: With dead ends: 52773 [2019-01-12 23:19:10,057 INFO L226 Difference]: Without dead ends: 52261 [2019-01-12 23:19:10,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52261 states. [2019-01-12 23:19:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52261 to 45377. [2019-01-12 23:19:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45377 states. [2019-01-12 23:19:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45377 states to 45377 states and 166020 transitions. [2019-01-12 23:19:12,241 INFO L78 Accepts]: Start accepts. Automaton has 45377 states and 166020 transitions. Word has length 49 [2019-01-12 23:19:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:12,242 INFO L480 AbstractCegarLoop]: Abstraction has 45377 states and 166020 transitions. [2019-01-12 23:19:12,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45377 states and 166020 transitions. [2019-01-12 23:19:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 23:19:12,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:12,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:12,253 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2019-01-12 23:19:12,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:12,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:12,329 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-12 23:19:12,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:12,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:12,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:12,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:12,331 INFO L87 Difference]: Start difference. First operand 45377 states and 166020 transitions. Second operand 3 states. [2019-01-12 23:19:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:12,650 INFO L93 Difference]: Finished difference Result 65253 states and 235816 transitions. [2019-01-12 23:19:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:12,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 23:19:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:12,813 INFO L225 Difference]: With dead ends: 65253 [2019-01-12 23:19:12,813 INFO L226 Difference]: Without dead ends: 65253 [2019-01-12 23:19:12,814 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-12 23:19:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-01-12 23:19:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 50947. [2019-01-12 23:19:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50947 states. [2019-01-12 23:19:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50947 states to 50947 states and 184327 transitions. [2019-01-12 23:19:13,964 INFO L78 Accepts]: Start accepts. Automaton has 50947 states and 184327 transitions. Word has length 51 [2019-01-12 23:19:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:13,965 INFO L480 AbstractCegarLoop]: Abstraction has 50947 states and 184327 transitions. [2019-01-12 23:19:13,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 50947 states and 184327 transitions. [2019-01-12 23:19:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:13,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:13,981 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] [2019-01-12 23:19:13,982 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1723497845, now seen corresponding path program 1 times [2019-01-12 23:19:13,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:13,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:13,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:14,233 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-12 23:19:14,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:14,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:14,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:14,235 INFO L87 Difference]: Start difference. First operand 50947 states and 184327 transitions. Second operand 7 states. [2019-01-12 23:19:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:17,385 INFO L93 Difference]: Finished difference Result 83876 states and 290140 transitions. [2019-01-12 23:19:17,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:19:17,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-12 23:19:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:17,588 INFO L225 Difference]: With dead ends: 83876 [2019-01-12 23:19:17,588 INFO L226 Difference]: Without dead ends: 83876 [2019-01-12 23:19:17,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:19:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83876 states. [2019-01-12 23:19:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83876 to 66523. [2019-01-12 23:19:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66523 states. [2019-01-12 23:19:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66523 states to 66523 states and 234927 transitions. [2019-01-12 23:19:19,099 INFO L78 Accepts]: Start accepts. Automaton has 66523 states and 234927 transitions. Word has length 55 [2019-01-12 23:19:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:19,099 INFO L480 AbstractCegarLoop]: Abstraction has 66523 states and 234927 transitions. [2019-01-12 23:19:19,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 66523 states and 234927 transitions. [2019-01-12 23:19:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:19,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:19,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:19,120 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash -835994164, now seen corresponding path program 1 times [2019-01-12 23:19:19,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:19,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:19,227 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-12 23:19:19,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:19,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:19,231 INFO L87 Difference]: Start difference. First operand 66523 states and 234927 transitions. Second operand 3 states. [2019-01-12 23:19:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:21,992 INFO L93 Difference]: Finished difference Result 51865 states and 182888 transitions. [2019-01-12 23:19:21,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:21,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-12 23:19:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:22,111 INFO L225 Difference]: With dead ends: 51865 [2019-01-12 23:19:22,112 INFO L226 Difference]: Without dead ends: 51865 [2019-01-12 23:19:22,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51865 states. [2019-01-12 23:19:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51865 to 51146. [2019-01-12 23:19:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51146 states. [2019-01-12 23:19:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51146 states to 51146 states and 180500 transitions. [2019-01-12 23:19:23,143 INFO L78 Accepts]: Start accepts. Automaton has 51146 states and 180500 transitions. Word has length 55 [2019-01-12 23:19:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:23,144 INFO L480 AbstractCegarLoop]: Abstraction has 51146 states and 180500 transitions. [2019-01-12 23:19:23,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 51146 states and 180500 transitions. [2019-01-12 23:19:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:23,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:23,155 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] [2019-01-12 23:19:23,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2019-01-12 23:19:23,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:23,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:23,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:23,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:23,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:23,552 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-12 23:19:23,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:23,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:23,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:23,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:23,554 INFO L87 Difference]: Start difference. First operand 51146 states and 180500 transitions. Second operand 6 states. [2019-01-12 23:19:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:24,639 INFO L93 Difference]: Finished difference Result 90371 states and 318143 transitions. [2019-01-12 23:19:24,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:19:24,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-01-12 23:19:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:24,852 INFO L225 Difference]: With dead ends: 90371 [2019-01-12 23:19:24,852 INFO L226 Difference]: Without dead ends: 89795 [2019-01-12 23:19:24,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:19:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89795 states. [2019-01-12 23:19:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89795 to 51193. [2019-01-12 23:19:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51193 states. [2019-01-12 23:19:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51193 states to 51193 states and 181120 transitions. [2019-01-12 23:19:27,045 INFO L78 Accepts]: Start accepts. Automaton has 51193 states and 181120 transitions. Word has length 55 [2019-01-12 23:19:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:27,046 INFO L480 AbstractCegarLoop]: Abstraction has 51193 states and 181120 transitions. [2019-01-12 23:19:27,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 51193 states and 181120 transitions. [2019-01-12 23:19:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-12 23:19:27,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:27,056 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] [2019-01-12 23:19:27,056 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:27,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash -399513608, now seen corresponding path program 1 times [2019-01-12 23:19:27,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:27,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:27,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:27,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:27,219 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-12 23:19:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:27,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:27,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:27,221 INFO L87 Difference]: Start difference. First operand 51193 states and 181120 transitions. Second operand 6 states. [2019-01-12 23:19:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:28,273 INFO L93 Difference]: Finished difference Result 101360 states and 349044 transitions. [2019-01-12 23:19:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:19:28,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-12 23:19:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:28,551 INFO L225 Difference]: With dead ends: 101360 [2019-01-12 23:19:28,551 INFO L226 Difference]: Without dead ends: 101360 [2019-01-12 23:19:28,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:19:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101360 states. [2019-01-12 23:19:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101360 to 71290. [2019-01-12 23:19:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71290 states. [2019-01-12 23:19:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71290 states to 71290 states and 248039 transitions. [2019-01-12 23:19:30,181 INFO L78 Accepts]: Start accepts. Automaton has 71290 states and 248039 transitions. Word has length 56 [2019-01-12 23:19:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:30,181 INFO L480 AbstractCegarLoop]: Abstraction has 71290 states and 248039 transitions. [2019-01-12 23:19:30,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 71290 states and 248039 transitions. [2019-01-12 23:19:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-12 23:19:30,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:30,194 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] [2019-01-12 23:19:30,195 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash 487990073, now seen corresponding path program 1 times [2019-01-12 23:19:30,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:30,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:30,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:30,349 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-12 23:19:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:30,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:30,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:30,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:30,350 INFO L87 Difference]: Start difference. First operand 71290 states and 248039 transitions. Second operand 4 states. [2019-01-12 23:19:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:30,484 INFO L93 Difference]: Finished difference Result 15623 states and 48375 transitions. [2019-01-12 23:19:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:19:30,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-12 23:19:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:30,508 INFO L225 Difference]: With dead ends: 15623 [2019-01-12 23:19:30,508 INFO L226 Difference]: Without dead ends: 13805 [2019-01-12 23:19:30,508 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-12 23:19:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13805 states. [2019-01-12 23:19:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13805 to 13757. [2019-01-12 23:19:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-01-12 23:19:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 42191 transitions. [2019-01-12 23:19:31,325 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 42191 transitions. Word has length 56 [2019-01-12 23:19:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:31,325 INFO L480 AbstractCegarLoop]: Abstraction has 13757 states and 42191 transitions. [2019-01-12 23:19:31,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 42191 transitions. [2019-01-12 23:19:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 23:19:31,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:31,330 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-12 23:19:31,330 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2019-01-12 23:19:31,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:31,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:31,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:31,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:31,448 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-12 23:19:31,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:31,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:31,449 INFO L87 Difference]: Start difference. First operand 13757 states and 42191 transitions. Second operand 4 states. [2019-01-12 23:19:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:31,608 INFO L93 Difference]: Finished difference Result 15684 states and 48197 transitions. [2019-01-12 23:19:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:19:31,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-12 23:19:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:31,634 INFO L225 Difference]: With dead ends: 15684 [2019-01-12 23:19:31,634 INFO L226 Difference]: Without dead ends: 15684 [2019-01-12 23:19:31,635 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-12 23:19:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15684 states. [2019-01-12 23:19:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15684 to 14157. [2019-01-12 23:19:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14157 states. [2019-01-12 23:19:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 43446 transitions. [2019-01-12 23:19:31,847 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 43446 transitions. Word has length 63 [2019-01-12 23:19:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:31,847 INFO L480 AbstractCegarLoop]: Abstraction has 14157 states and 43446 transitions. [2019-01-12 23:19:31,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 43446 transitions. [2019-01-12 23:19:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 23:19:31,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:31,851 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-12 23:19:31,851 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2019-01-12 23:19:31,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:31,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:32,087 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-12 23:19:32,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:32,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:19:32,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:19:32,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:19:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:19:32,089 INFO L87 Difference]: Start difference. First operand 14157 states and 43446 transitions. Second operand 8 states. [2019-01-12 23:19:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:33,158 INFO L93 Difference]: Finished difference Result 19379 states and 58570 transitions. [2019-01-12 23:19:33,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:19:33,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-01-12 23:19:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:33,190 INFO L225 Difference]: With dead ends: 19379 [2019-01-12 23:19:33,190 INFO L226 Difference]: Without dead ends: 19308 [2019-01-12 23:19:33,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:19:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19308 states. [2019-01-12 23:19:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19308 to 16576. [2019-01-12 23:19:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16576 states. [2019-01-12 23:19:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16576 states to 16576 states and 50495 transitions. [2019-01-12 23:19:33,449 INFO L78 Accepts]: Start accepts. Automaton has 16576 states and 50495 transitions. Word has length 63 [2019-01-12 23:19:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:33,449 INFO L480 AbstractCegarLoop]: Abstraction has 16576 states and 50495 transitions. [2019-01-12 23:19:33,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:19:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 16576 states and 50495 transitions. [2019-01-12 23:19:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:33,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:33,457 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-12 23:19:33,457 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -955693609, now seen corresponding path program 1 times [2019-01-12 23:19:33,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:33,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:33,576 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-12 23:19:33,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:33,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:33,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:33,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:33,578 INFO L87 Difference]: Start difference. First operand 16576 states and 50495 transitions. Second operand 3 states. [2019-01-12 23:19:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:33,801 INFO L93 Difference]: Finished difference Result 19752 states and 60221 transitions. [2019-01-12 23:19:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:33,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:19:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:33,833 INFO L225 Difference]: With dead ends: 19752 [2019-01-12 23:19:33,833 INFO L226 Difference]: Without dead ends: 19752 [2019-01-12 23:19:33,834 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-12 23:19:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19752 states. [2019-01-12 23:19:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19752 to 19332. [2019-01-12 23:19:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19332 states. [2019-01-12 23:19:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19332 states to 19332 states and 58922 transitions. [2019-01-12 23:19:34,106 INFO L78 Accepts]: Start accepts. Automaton has 19332 states and 58922 transitions. Word has length 69 [2019-01-12 23:19:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:34,106 INFO L480 AbstractCegarLoop]: Abstraction has 19332 states and 58922 transitions. [2019-01-12 23:19:34,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19332 states and 58922 transitions. [2019-01-12 23:19:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:34,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:34,116 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-12 23:19:34,117 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:34,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1728761431, now seen corresponding path program 1 times [2019-01-12 23:19:34,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:34,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:34,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:34,382 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-12 23:19:34,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:34,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:34,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:34,385 INFO L87 Difference]: Start difference. First operand 19332 states and 58922 transitions. Second operand 4 states. [2019-01-12 23:19:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:34,881 INFO L93 Difference]: Finished difference Result 24729 states and 74596 transitions. [2019-01-12 23:19:34,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:19:34,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-01-12 23:19:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:34,921 INFO L225 Difference]: With dead ends: 24729 [2019-01-12 23:19:34,921 INFO L226 Difference]: Without dead ends: 24729 [2019-01-12 23:19:34,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24729 states. [2019-01-12 23:19:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24729 to 21566. [2019-01-12 23:19:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21566 states. [2019-01-12 23:19:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21566 states to 21566 states and 65327 transitions. [2019-01-12 23:19:35,245 INFO L78 Accepts]: Start accepts. Automaton has 21566 states and 65327 transitions. Word has length 69 [2019-01-12 23:19:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:35,246 INFO L480 AbstractCegarLoop]: Abstraction has 21566 states and 65327 transitions. [2019-01-12 23:19:35,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21566 states and 65327 transitions. [2019-01-12 23:19:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:35,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:35,257 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-12 23:19:35,258 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1321441384, now seen corresponding path program 1 times [2019-01-12 23:19:35,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:35,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:35,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:35,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:35,538 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-12 23:19:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:35,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:35,540 INFO L87 Difference]: Start difference. First operand 21566 states and 65327 transitions. Second operand 6 states. [2019-01-12 23:19:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:36,888 INFO L93 Difference]: Finished difference Result 26052 states and 77633 transitions. [2019-01-12 23:19:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:19:36,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-12 23:19:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:36,934 INFO L225 Difference]: With dead ends: 26052 [2019-01-12 23:19:36,935 INFO L226 Difference]: Without dead ends: 26052 [2019-01-12 23:19:36,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26052 states. [2019-01-12 23:19:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26052 to 24938. [2019-01-12 23:19:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24938 states. [2019-01-12 23:19:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24938 states to 24938 states and 74788 transitions. [2019-01-12 23:19:37,299 INFO L78 Accepts]: Start accepts. Automaton has 24938 states and 74788 transitions. Word has length 69 [2019-01-12 23:19:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:37,299 INFO L480 AbstractCegarLoop]: Abstraction has 24938 states and 74788 transitions. [2019-01-12 23:19:37,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 24938 states and 74788 transitions. [2019-01-12 23:19:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:37,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:37,312 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-12 23:19:37,312 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 896316569, now seen corresponding path program 1 times [2019-01-12 23:19:37,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:37,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:37,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:37,531 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-12 23:19:37,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:37,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:37,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:37,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:37,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:37,532 INFO L87 Difference]: Start difference. First operand 24938 states and 74788 transitions. Second operand 6 states. [2019-01-12 23:19:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:38,095 INFO L93 Difference]: Finished difference Result 28251 states and 82473 transitions. [2019-01-12 23:19:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:19:38,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-12 23:19:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:38,139 INFO L225 Difference]: With dead ends: 28251 [2019-01-12 23:19:38,139 INFO L226 Difference]: Without dead ends: 28251 [2019-01-12 23:19:38,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28251 states. [2019-01-12 23:19:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28251 to 25152. [2019-01-12 23:19:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25152 states. [2019-01-12 23:19:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25152 states to 25152 states and 74492 transitions. [2019-01-12 23:19:38,517 INFO L78 Accepts]: Start accepts. Automaton has 25152 states and 74492 transitions. Word has length 69 [2019-01-12 23:19:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:38,518 INFO L480 AbstractCegarLoop]: Abstraction has 25152 states and 74492 transitions. [2019-01-12 23:19:38,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25152 states and 74492 transitions. [2019-01-12 23:19:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:38,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:38,532 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-12 23:19:38,532 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1107667482, now seen corresponding path program 1 times [2019-01-12 23:19:38,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:38,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:38,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:38,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:38,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:38,940 INFO L87 Difference]: Start difference. First operand 25152 states and 74492 transitions. Second operand 5 states. [2019-01-12 23:19:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:39,726 INFO L93 Difference]: Finished difference Result 29895 states and 87944 transitions. [2019-01-12 23:19:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:19:39,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-01-12 23:19:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:39,773 INFO L225 Difference]: With dead ends: 29895 [2019-01-12 23:19:39,773 INFO L226 Difference]: Without dead ends: 29895 [2019-01-12 23:19:39,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29895 states. [2019-01-12 23:19:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29895 to 27556. [2019-01-12 23:19:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27556 states. [2019-01-12 23:19:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27556 states to 27556 states and 81052 transitions. [2019-01-12 23:19:40,201 INFO L78 Accepts]: Start accepts. Automaton has 27556 states and 81052 transitions. Word has length 69 [2019-01-12 23:19:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:40,201 INFO L480 AbstractCegarLoop]: Abstraction has 27556 states and 81052 transitions. [2019-01-12 23:19:40,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27556 states and 81052 transitions. [2019-01-12 23:19:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:40,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:40,212 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-12 23:19:40,212 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2019-01-12 23:19:40,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:40,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:40,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:40,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:40,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:40,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:40,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:40,400 INFO L87 Difference]: Start difference. First operand 27556 states and 81052 transitions. Second operand 7 states. [2019-01-12 23:19:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:41,088 INFO L93 Difference]: Finished difference Result 27314 states and 78217 transitions. [2019-01-12 23:19:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:19:41,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-01-12 23:19:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:41,136 INFO L225 Difference]: With dead ends: 27314 [2019-01-12 23:19:41,136 INFO L226 Difference]: Without dead ends: 27314 [2019-01-12 23:19:41,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:19:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27314 states. [2019-01-12 23:19:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27314 to 24927. [2019-01-12 23:19:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2019-01-12 23:19:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2019-01-12 23:19:41,683 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2019-01-12 23:19:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:41,683 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2019-01-12 23:19:41,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2019-01-12 23:19:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:41,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:41,693 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-12 23:19:41,693 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1199818054, now seen corresponding path program 1 times [2019-01-12 23:19:41,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:41,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:41,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:41,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:41,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:41,885 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-12 23:19:41,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:41,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:41,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:41,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:41,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:41,886 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2019-01-12 23:19:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:41,939 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2019-01-12 23:19:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:19:41,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-01-12 23:19:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:41,947 INFO L225 Difference]: With dead ends: 7463 [2019-01-12 23:19:41,948 INFO L226 Difference]: Without dead ends: 6138 [2019-01-12 23:19:41,948 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-12 23:19:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-01-12 23:19:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2019-01-12 23:19:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-01-12 23:19:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2019-01-12 23:19:42,009 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2019-01-12 23:19:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:42,009 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2019-01-12 23:19:42,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2019-01-12 23:19:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:42,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:42,015 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-12 23:19:42,015 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2019-01-12 23:19:42,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:42,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:42,092 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-12 23:19:42,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:42,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:42,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:42,093 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2019-01-12 23:19:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:42,157 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2019-01-12 23:19:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:42,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:19:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:42,165 INFO L225 Difference]: With dead ends: 7168 [2019-01-12 23:19:42,166 INFO L226 Difference]: Without dead ends: 7168 [2019-01-12 23:19:42,166 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-12 23:19:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2019-01-12 23:19:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2019-01-12 23:19:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2019-01-12 23:19:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2019-01-12 23:19:42,230 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2019-01-12 23:19:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:42,230 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2019-01-12 23:19:42,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2019-01-12 23:19:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 23:19:42,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:42,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:42,236 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2019-01-12 23:19:42,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:42,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:42,449 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-12 23:19:42,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:42,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:42,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:42,450 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2019-01-12 23:19:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:42,643 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2019-01-12 23:19:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:19:42,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-01-12 23:19:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:42,653 INFO L225 Difference]: With dead ends: 6625 [2019-01-12 23:19:42,653 INFO L226 Difference]: Without dead ends: 6625 [2019-01-12 23:19:42,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2019-01-12 23:19:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2019-01-12 23:19:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2019-01-12 23:19:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2019-01-12 23:19:42,717 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2019-01-12 23:19:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:42,718 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2019-01-12 23:19:42,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2019-01-12 23:19:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 23:19:42,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:42,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:19:42,724 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2019-01-12 23:19:42,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:42,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:42,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:42,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:42,929 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-12 23:19:42,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:42,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:42,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:42,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:42,931 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 7 states. [2019-01-12 23:19:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:44,956 INFO L93 Difference]: Finished difference Result 6842 states and 15342 transitions. [2019-01-12 23:19:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:19:44,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-01-12 23:19:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:44,965 INFO L225 Difference]: With dead ends: 6842 [2019-01-12 23:19:44,966 INFO L226 Difference]: Without dead ends: 6740 [2019-01-12 23:19:44,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 23:19:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2019-01-12 23:19:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6012. [2019-01-12 23:19:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2019-01-12 23:19:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2019-01-12 23:19:45,033 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2019-01-12 23:19:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:45,034 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2019-01-12 23:19:45,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2019-01-12 23:19:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:19:45,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:45,041 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] [2019-01-12 23:19:45,041 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:45,042 INFO L82 PathProgramCache]: Analyzing trace with hash 189178790, now seen corresponding path program 1 times [2019-01-12 23:19:45,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:45,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:45,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:45,209 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-12 23:19:45,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:45,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:45,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:45,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:45,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:45,210 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2019-01-12 23:19:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:46,621 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2019-01-12 23:19:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:19:46,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:19:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:46,633 INFO L225 Difference]: With dead ends: 7492 [2019-01-12 23:19:46,634 INFO L226 Difference]: Without dead ends: 7492 [2019-01-12 23:19:46,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-01-12 23:19:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2019-01-12 23:19:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-01-12 23:19:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2019-01-12 23:19:46,730 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2019-01-12 23:19:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:46,731 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2019-01-12 23:19:46,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2019-01-12 23:19:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:19:46,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:46,739 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] [2019-01-12 23:19:46,740 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash -717021655, now seen corresponding path program 1 times [2019-01-12 23:19:46,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:46,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:46,990 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-12 23:19:46,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:46,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:46,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:46,991 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2019-01-12 23:19:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:47,170 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2019-01-12 23:19:47,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:19:47,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-12 23:19:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:47,180 INFO L225 Difference]: With dead ends: 7319 [2019-01-12 23:19:47,180 INFO L226 Difference]: Without dead ends: 7319 [2019-01-12 23:19:47,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2019-01-12 23:19:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2019-01-12 23:19:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2019-01-12 23:19:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2019-01-12 23:19:47,254 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2019-01-12 23:19:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:47,254 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2019-01-12 23:19:47,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2019-01-12 23:19:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:47,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:47,264 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-12 23:19:47,264 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1567376623, now seen corresponding path program 1 times [2019-01-12 23:19:47,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:47,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:47,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:47,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:47,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:47,402 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2019-01-12 23:19:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:47,540 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2019-01-12 23:19:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:19:47,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-01-12 23:19:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:47,549 INFO L225 Difference]: With dead ends: 7016 [2019-01-12 23:19:47,549 INFO L226 Difference]: Without dead ends: 7016 [2019-01-12 23:19:47,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2019-01-12 23:19:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2019-01-12 23:19:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-01-12 23:19:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2019-01-12 23:19:47,612 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2019-01-12 23:19:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:47,613 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2019-01-12 23:19:47,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2019-01-12 23:19:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:47,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:47,619 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-12 23:19:47,619 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1578692750, now seen corresponding path program 1 times [2019-01-12 23:19:47,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:47,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:47,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:47,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:47,726 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-12 23:19:47,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:47,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:47,727 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2019-01-12 23:19:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:47,997 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2019-01-12 23:19:47,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:19:47,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-12 23:19:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:48,007 INFO L225 Difference]: With dead ends: 6953 [2019-01-12 23:19:48,007 INFO L226 Difference]: Without dead ends: 6886 [2019-01-12 23:19:48,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2019-01-12 23:19:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2019-01-12 23:19:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2019-01-12 23:19:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2019-01-12 23:19:48,079 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2019-01-12 23:19:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:48,079 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2019-01-12 23:19:48,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2019-01-12 23:19:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:48,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:48,086 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-12 23:19:48,087 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash -498516593, now seen corresponding path program 1 times [2019-01-12 23:19:48,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:48,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:48,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:48,350 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-12 23:19:48,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:48,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:19:48,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:19:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:19:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:48,351 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 9 states. [2019-01-12 23:19:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:49,185 INFO L93 Difference]: Finished difference Result 8235 states and 18257 transitions. [2019-01-12 23:19:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 23:19:49,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:19:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:49,197 INFO L225 Difference]: With dead ends: 8235 [2019-01-12 23:19:49,197 INFO L226 Difference]: Without dead ends: 8235 [2019-01-12 23:19:49,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-01-12 23:19:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8235 states. [2019-01-12 23:19:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8235 to 7030. [2019-01-12 23:19:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7030 states. [2019-01-12 23:19:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 15670 transitions. [2019-01-12 23:19:49,275 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 15670 transitions. Word has length 98 [2019-01-12 23:19:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:49,275 INFO L480 AbstractCegarLoop]: Abstraction has 7030 states and 15670 transitions. [2019-01-12 23:19:49,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:19:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 15670 transitions. [2019-01-12 23:19:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:49,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:49,283 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-12 23:19:49,283 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2019-01-12 23:19:49,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:49,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:50,520 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-12 23:19:50,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:50,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:19:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:19:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:19:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:50,521 INFO L87 Difference]: Start difference. First operand 7030 states and 15670 transitions. Second operand 9 states. [2019-01-12 23:19:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:51,096 INFO L93 Difference]: Finished difference Result 8246 states and 18329 transitions. [2019-01-12 23:19:51,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 23:19:51,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:19:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:51,107 INFO L225 Difference]: With dead ends: 8246 [2019-01-12 23:19:51,108 INFO L226 Difference]: Without dead ends: 8159 [2019-01-12 23:19:51,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-01-12 23:19:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2019-01-12 23:19:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 6991. [2019-01-12 23:19:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6991 states. [2019-01-12 23:19:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 15582 transitions. [2019-01-12 23:19:51,189 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 15582 transitions. Word has length 98 [2019-01-12 23:19:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:51,189 INFO L480 AbstractCegarLoop]: Abstraction has 6991 states and 15582 transitions. [2019-01-12 23:19:51,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:19:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 15582 transitions. [2019-01-12 23:19:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:51,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:51,197 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-12 23:19:51,197 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2019-01-12 23:19:51,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:51,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:51,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:51,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:51,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:51,409 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-12 23:19:51,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:51,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:19:51,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:19:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:19:51,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:51,410 INFO L87 Difference]: Start difference. First operand 6991 states and 15582 transitions. Second operand 9 states. [2019-01-12 23:19:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:52,277 INFO L93 Difference]: Finished difference Result 11197 states and 24928 transitions. [2019-01-12 23:19:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:19:52,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:19:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:52,289 INFO L225 Difference]: With dead ends: 11197 [2019-01-12 23:19:52,289 INFO L226 Difference]: Without dead ends: 8089 [2019-01-12 23:19:52,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:19:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2019-01-12 23:19:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 7048. [2019-01-12 23:19:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2019-01-12 23:19:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 15699 transitions. [2019-01-12 23:19:52,365 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 15699 transitions. Word has length 98 [2019-01-12 23:19:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:52,366 INFO L480 AbstractCegarLoop]: Abstraction has 7048 states and 15699 transitions. [2019-01-12 23:19:52,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:19:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 15699 transitions. [2019-01-12 23:19:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:52,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:52,373 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-12 23:19:52,374 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash -543309766, now seen corresponding path program 1 times [2019-01-12 23:19:52,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:52,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:52,798 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 23:19:53,222 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-12 23:19:53,231 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-12 23:19:53,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:53,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:53,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:53,232 INFO L87 Difference]: Start difference. First operand 7048 states and 15699 transitions. Second operand 6 states. [2019-01-12 23:19:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:53,456 INFO L93 Difference]: Finished difference Result 7978 states and 17540 transitions. [2019-01-12 23:19:53,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:19:53,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-12 23:19:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:53,466 INFO L225 Difference]: With dead ends: 7978 [2019-01-12 23:19:53,466 INFO L226 Difference]: Without dead ends: 7926 [2019-01-12 23:19:53,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2019-01-12 23:19:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 6952. [2019-01-12 23:19:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2019-01-12 23:19:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 15372 transitions. [2019-01-12 23:19:53,547 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 15372 transitions. Word has length 98 [2019-01-12 23:19:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:53,548 INFO L480 AbstractCegarLoop]: Abstraction has 6952 states and 15372 transitions. [2019-01-12 23:19:53,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 15372 transitions. [2019-01-12 23:19:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:53,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:53,555 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-12 23:19:53,556 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1661772762, now seen corresponding path program 2 times [2019-01-12 23:19:53,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:53,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:54,071 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-12 23:19:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:54,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:54,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:54,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:54,073 INFO L87 Difference]: Start difference. First operand 6952 states and 15372 transitions. Second operand 6 states. [2019-01-12 23:19:54,426 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 23:19:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:54,663 INFO L93 Difference]: Finished difference Result 7313 states and 16120 transitions. [2019-01-12 23:19:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:19:54,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-12 23:19:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:54,675 INFO L225 Difference]: With dead ends: 7313 [2019-01-12 23:19:54,675 INFO L226 Difference]: Without dead ends: 7313 [2019-01-12 23:19:54,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:19:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2019-01-12 23:19:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 6856. [2019-01-12 23:19:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6856 states. [2019-01-12 23:19:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 15165 transitions. [2019-01-12 23:19:54,749 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 15165 transitions. Word has length 98 [2019-01-12 23:19:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:54,750 INFO L480 AbstractCegarLoop]: Abstraction has 6856 states and 15165 transitions. [2019-01-12 23:19:54,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 15165 transitions. [2019-01-12 23:19:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:54,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:54,757 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-12 23:19:54,758 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2019-01-12 23:19:54,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:54,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:54,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:54,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:19:54,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:55,118 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-12 23:19:55,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:55,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:19:55,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:19:55,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:19:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:55,120 INFO L87 Difference]: Start difference. First operand 6856 states and 15165 transitions. Second operand 9 states. [2019-01-12 23:19:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:55,336 INFO L93 Difference]: Finished difference Result 10878 states and 24160 transitions. [2019-01-12 23:19:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:19:55,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:19:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:55,342 INFO L225 Difference]: With dead ends: 10878 [2019-01-12 23:19:55,343 INFO L226 Difference]: Without dead ends: 4267 [2019-01-12 23:19:55,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:19:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2019-01-12 23:19:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4267. [2019-01-12 23:19:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2019-01-12 23:19:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 9470 transitions. [2019-01-12 23:19:55,385 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 9470 transitions. Word has length 98 [2019-01-12 23:19:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:55,385 INFO L480 AbstractCegarLoop]: Abstraction has 4267 states and 9470 transitions. [2019-01-12 23:19:55,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:19:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 9470 transitions. [2019-01-12 23:19:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:55,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:55,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:19:55,391 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 3 times [2019-01-12 23:19:55,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:55,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:55,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:19:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:55,561 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:19:55,655 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-12 23:19:55,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:55,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:19:55,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:19:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:19:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:19:55,657 INFO L87 Difference]: Start difference. First operand 4267 states and 9470 transitions. Second operand 11 states. [2019-01-12 23:19:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:56,951 INFO L93 Difference]: Finished difference Result 8508 states and 19055 transitions. [2019-01-12 23:19:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 23:19:56,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-01-12 23:19:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:56,961 INFO L225 Difference]: With dead ends: 8508 [2019-01-12 23:19:56,961 INFO L226 Difference]: Without dead ends: 5551 [2019-01-12 23:19:56,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-01-12 23:19:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2019-01-12 23:19:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 4300. [2019-01-12 23:19:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4300 states. [2019-01-12 23:19:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 9496 transitions. [2019-01-12 23:19:57,011 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 9496 transitions. Word has length 98 [2019-01-12 23:19:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:57,011 INFO L480 AbstractCegarLoop]: Abstraction has 4300 states and 9496 transitions. [2019-01-12 23:19:57,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:19:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 9496 transitions. [2019-01-12 23:19:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:57,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:57,016 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-12 23:19:57,016 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash 735273941, now seen corresponding path program 1 times [2019-01-12 23:19:57,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:57,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:57,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:19:57,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:57,781 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-12 23:19:57,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:57,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:57,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:57,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:57,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:57,782 INFO L87 Difference]: Start difference. First operand 4300 states and 9496 transitions. Second operand 7 states. [2019-01-12 23:19:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:58,114 INFO L93 Difference]: Finished difference Result 4553 states and 9994 transitions. [2019-01-12 23:19:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:19:58,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-12 23:19:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:58,121 INFO L225 Difference]: With dead ends: 4553 [2019-01-12 23:19:58,121 INFO L226 Difference]: Without dead ends: 4553 [2019-01-12 23:19:58,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:19:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2019-01-12 23:19:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4344. [2019-01-12 23:19:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2019-01-12 23:19:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 9578 transitions. [2019-01-12 23:19:58,165 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 9578 transitions. Word has length 98 [2019-01-12 23:19:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:58,165 INFO L480 AbstractCegarLoop]: Abstraction has 4344 states and 9578 transitions. [2019-01-12 23:19:58,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 9578 transitions. [2019-01-12 23:19:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:58,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:58,172 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-12 23:19:58,172 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 766293748, now seen corresponding path program 1 times [2019-01-12 23:19:58,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:58,855 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-12 23:19:58,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:58,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:58,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:58,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:58,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:58,856 INFO L87 Difference]: Start difference. First operand 4344 states and 9578 transitions. Second operand 7 states. [2019-01-12 23:19:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:59,625 INFO L93 Difference]: Finished difference Result 5452 states and 11772 transitions. [2019-01-12 23:19:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 23:19:59,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-12 23:19:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:59,633 INFO L225 Difference]: With dead ends: 5452 [2019-01-12 23:19:59,633 INFO L226 Difference]: Without dead ends: 5452 [2019-01-12 23:19:59,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-12 23:19:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-01-12 23:19:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4633. [2019-01-12 23:19:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4633 states. [2019-01-12 23:19:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 10199 transitions. [2019-01-12 23:19:59,685 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 10199 transitions. Word has length 98 [2019-01-12 23:19:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:59,685 INFO L480 AbstractCegarLoop]: Abstraction has 4633 states and 10199 transitions. [2019-01-12 23:19:59,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 10199 transitions. [2019-01-12 23:19:59,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:19:59,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:59,691 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-12 23:19:59,691 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1271762541, now seen corresponding path program 4 times [2019-01-12 23:19:59,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:59,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:59,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:19:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:19:59,793 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:19:59,997 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:19:59,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:19:59 BasicIcfg [2019-01-12 23:19:59,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:20:00,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:20:00,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:20:00,002 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:20:00,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:18:55" (3/4) ... [2019-01-12 23:20:00,008 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:20:00,182 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:20:00,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:20:00,183 INFO L168 Benchmark]: Toolchain (without parser) took 67242.47 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 952.7 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 655.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:00,184 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-12 23:20:00,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:00,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.77 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-12 23:20:00,186 INFO L168 Benchmark]: Boogie Preprocessor took 43.18 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-12 23:20:00,188 INFO L168 Benchmark]: RCFGBuilder took 1201.80 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:00,189 INFO L168 Benchmark]: TraceAbstraction took 64909.97 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 562.0 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:00,189 INFO L168 Benchmark]: Witness Printer took 180.15 ms. Allocated memory is still 5.1 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:00,195 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 829.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.77 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 43.18 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 1201.80 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64909.97 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 562.0 MB. Max. memory is 11.5 GB. * Witness Printer took 180.15 ms. Allocated memory is still 5.1 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t247; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t247, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t248; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t248, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 64.6s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 33.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9547 SDtfs, 11819 SDslu, 22999 SDs, 0 SdLazy, 9693 SolverSat, 520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 85 SyntacticMatches, 38 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71290occurred in iteration=8, 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: 18.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 178785 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 2657 NumberOfCodeBlocks, 2657 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2525 ConstructedInterpolants, 0 QuantifiedInterpolants, 573418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...