./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c2480fd206faf06e31cc180dc59749750db48b4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 22:19:27,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:19:27,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:19:27,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:19:27,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:19:27,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:19:27,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:19:27,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:19:27,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:19:27,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:19:27,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:19:27,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:19:27,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:19:27,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:19:27,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:19:27,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:19:27,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:19:27,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:19:27,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:19:27,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:19:27,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:19:27,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:19:27,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:19:27,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:19:27,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:19:27,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:19:27,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:19:27,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:19:27,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:19:27,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:19:27,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:19:27,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:19:27,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:19:27,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:19:27,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:19:27,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:19:27,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:19:27,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:19:27,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:19:27,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:19:27,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:19:27,986 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:19:27,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:19:27,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:19:27,987 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:19:27,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:19:27,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:19:27,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:19:27,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:19:27,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:19:27,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:19:27,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:19:27,989 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:19:27,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:19:27,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:19:27,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:19:27,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:19:27,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:19:27,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:19:27,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:19:27,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:19:27,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:19:27,991 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:19:27,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:19:27,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:19:27,992 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 -> 6c2480fd206faf06e31cc180dc59749750db48b4 [2018-12-31 22:19:28,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:19:28,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:19:28,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:19:28,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:19:28,056 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:19:28,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i [2018-12-31 22:19:28,130 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0753a6c9/ea5269e83133405e8376ca3fc4aa09aa/FLAG85bd79aaa [2018-12-31 22:19:28,658 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:19:28,659 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_tso.oepc_false-unreach-call.i [2018-12-31 22:19:28,675 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0753a6c9/ea5269e83133405e8376ca3fc4aa09aa/FLAG85bd79aaa [2018-12-31 22:19:28,923 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0753a6c9/ea5269e83133405e8376ca3fc4aa09aa [2018-12-31 22:19:28,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:19:28,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:19:28,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:19:28,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:19:28,937 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:19:28,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:19:28" (1/1) ... [2018-12-31 22:19:28,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:28, skipping insertion in model container [2018-12-31 22:19:28,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:19:28" (1/1) ... [2018-12-31 22:19:28,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:19:29,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:19:29,456 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:19:29,485 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:19:29,717 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:19:29,832 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:19:29,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29 WrapperNode [2018-12-31 22:19:29,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:19:29,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:19:29,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:19:29,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:19:29,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:19:29,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:19:29,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:19:29,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:19:29,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:29,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:30,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... [2018-12-31 22:19:30,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:19:30,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:19:30,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:19:30,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:19:30,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:19:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:19:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:19:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:19:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:19:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:19:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:19:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:19:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:19:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:19:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:19:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:19:30,117 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:19:31,376 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:19:31,377 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:19:31,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:19:31 BoogieIcfgContainer [2018-12-31 22:19:31,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:19:31,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:19:31,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:19:31,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:19:31,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:19:28" (1/3) ... [2018-12-31 22:19:31,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1ebf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:19:31, skipping insertion in model container [2018-12-31 22:19:31,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:19:29" (2/3) ... [2018-12-31 22:19:31,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1ebf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:19:31, skipping insertion in model container [2018-12-31 22:19:31,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:19:31" (3/3) ... [2018-12-31 22:19:31,389 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc_false-unreach-call.i [2018-12-31 22:19:31,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,438 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,438 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,453 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,453 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,453 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,454 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,455 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:19:31,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:19:31,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:19:31,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:19:31,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:19:31,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:19:31,559 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:19:31,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:19:31,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:19:31,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:19:31,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:19:31,560 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:19:31,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:19:31,560 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:19:31,574 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-31 22:19:33,453 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2018-12-31 22:19:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2018-12-31 22:19:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 22:19:33,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:33,467 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] [2018-12-31 22:19:33,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2018-12-31 22:19:33,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:33,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:33,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:33,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:33,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:19:33,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:19:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:19:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:19:33,939 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2018-12-31 22:19:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:35,038 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2018-12-31 22:19:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:19:35,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-31 22:19:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:35,498 INFO L225 Difference]: With dead ends: 45387 [2018-12-31 22:19:35,499 INFO L226 Difference]: Without dead ends: 40627 [2018-12-31 22:19:35,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:19:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2018-12-31 22:19:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2018-12-31 22:19:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2018-12-31 22:19:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2018-12-31 22:19:37,217 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2018-12-31 22:19:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:37,218 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2018-12-31 22:19:37,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:19:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2018-12-31 22:19:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 22:19:37,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:37,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:19:37,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1074635055, now seen corresponding path program 1 times [2018-12-31 22:19:37,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:37,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:37,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:37,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:19:37,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:19:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:19:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:19:37,589 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2018-12-31 22:19:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:41,375 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2018-12-31 22:19:41,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:19:41,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-31 22:19:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:41,740 INFO L225 Difference]: With dead ends: 64829 [2018-12-31 22:19:41,740 INFO L226 Difference]: Without dead ends: 64669 [2018-12-31 22:19:41,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:19:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2018-12-31 22:19:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2018-12-31 22:19:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2018-12-31 22:19:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2018-12-31 22:19:43,651 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2018-12-31 22:19:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:43,653 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2018-12-31 22:19:43,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:19:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2018-12-31 22:19:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 22:19:43,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:43,659 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] [2018-12-31 22:19:43,659 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2018-12-31 22:19:43,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:43,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:43,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:43,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:43,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:43,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:43,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:19:43,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:19:43,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:19:43,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:19:43,779 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2018-12-31 22:19:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:43,886 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2018-12-31 22:19:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:19:43,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-31 22:19:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:43,916 INFO L225 Difference]: With dead ends: 12363 [2018-12-31 22:19:43,916 INFO L226 Difference]: Without dead ends: 11842 [2018-12-31 22:19:43,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:19:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2018-12-31 22:19:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2018-12-31 22:19:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2018-12-31 22:19:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2018-12-31 22:19:44,194 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2018-12-31 22:19:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:44,195 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2018-12-31 22:19:44,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:19:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2018-12-31 22:19:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 22:19:44,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:44,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:19:44,202 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash -550854488, now seen corresponding path program 1 times [2018-12-31 22:19:44,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:44,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:44,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:44,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:19:44,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:19:44,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:19:44,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:19:44,380 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2018-12-31 22:19:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:44,885 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2018-12-31 22:19:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:19:44,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-31 22:19:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:44,919 INFO L225 Difference]: With dead ends: 17018 [2018-12-31 22:19:44,919 INFO L226 Difference]: Without dead ends: 17018 [2018-12-31 22:19:44,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:19:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2018-12-31 22:19:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2018-12-31 22:19:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-12-31 22:19:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2018-12-31 22:19:45,278 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2018-12-31 22:19:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:45,278 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2018-12-31 22:19:45,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:19:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2018-12-31 22:19:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 22:19:45,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:45,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:19:45,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -257181528, now seen corresponding path program 1 times [2018-12-31 22:19:45,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:45,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:45,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:45,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:19:45,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:19:45,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:19:45,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:19:45,446 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 4 states. [2018-12-31 22:19:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:46,924 INFO L93 Difference]: Finished difference Result 18385 states and 59996 transitions. [2018-12-31 22:19:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:19:46,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-31 22:19:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:46,966 INFO L225 Difference]: With dead ends: 18385 [2018-12-31 22:19:46,966 INFO L226 Difference]: Without dead ends: 18385 [2018-12-31 22:19:46,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:19:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18385 states. [2018-12-31 22:19:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18385 to 16342. [2018-12-31 22:19:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2018-12-31 22:19:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53813 transitions. [2018-12-31 22:19:47,297 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53813 transitions. Word has length 57 [2018-12-31 22:19:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:47,297 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53813 transitions. [2018-12-31 22:19:47,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:19:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53813 transitions. [2018-12-31 22:19:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 22:19:47,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:47,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:19:47,311 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1101653399, now seen corresponding path program 1 times [2018-12-31 22:19:47,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:47,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:47,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:47,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:47,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:47,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:19:47,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:19:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:19:47,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:19:47,491 INFO L87 Difference]: Start difference. First operand 16342 states and 53813 transitions. Second operand 6 states. [2018-12-31 22:19:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:48,409 INFO L93 Difference]: Finished difference Result 22914 states and 74398 transitions. [2018-12-31 22:19:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:19:48,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-31 22:19:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:48,455 INFO L225 Difference]: With dead ends: 22914 [2018-12-31 22:19:48,456 INFO L226 Difference]: Without dead ends: 22882 [2018-12-31 22:19:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:19:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22882 states. [2018-12-31 22:19:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22882 to 18246. [2018-12-31 22:19:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18246 states. [2018-12-31 22:19:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18246 states to 18246 states and 59757 transitions. [2018-12-31 22:19:48,818 INFO L78 Accepts]: Start accepts. Automaton has 18246 states and 59757 transitions. Word has length 57 [2018-12-31 22:19:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:48,819 INFO L480 AbstractCegarLoop]: Abstraction has 18246 states and 59757 transitions. [2018-12-31 22:19:48,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:19:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18246 states and 59757 transitions. [2018-12-31 22:19:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 22:19:48,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:48,847 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] [2018-12-31 22:19:48,848 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1846707644, now seen corresponding path program 1 times [2018-12-31 22:19:48,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:48,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:48,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:48,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:49,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:49,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:19:49,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:19:49,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:19:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:19:49,254 INFO L87 Difference]: Start difference. First operand 18246 states and 59757 transitions. Second operand 8 states. [2018-12-31 22:19:50,967 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 22:19:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:51,268 INFO L93 Difference]: Finished difference Result 25778 states and 82386 transitions. [2018-12-31 22:19:51,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:19:51,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-12-31 22:19:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:51,319 INFO L225 Difference]: With dead ends: 25778 [2018-12-31 22:19:51,320 INFO L226 Difference]: Without dead ends: 25714 [2018-12-31 22:19:51,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-31 22:19:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25714 states. [2018-12-31 22:19:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25714 to 20338. [2018-12-31 22:19:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20338 states. [2018-12-31 22:19:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20338 states to 20338 states and 66162 transitions. [2018-12-31 22:19:51,722 INFO L78 Accepts]: Start accepts. Automaton has 20338 states and 66162 transitions. Word has length 71 [2018-12-31 22:19:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:51,722 INFO L480 AbstractCegarLoop]: Abstraction has 20338 states and 66162 transitions. [2018-12-31 22:19:51,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:19:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 20338 states and 66162 transitions. [2018-12-31 22:19:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 22:19:51,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:51,749 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] [2018-12-31 22:19:51,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2049921486, now seen corresponding path program 1 times [2018-12-31 22:19:51,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:51,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:51,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:51,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:19:51,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:19:51,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:19:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:19:51,834 INFO L87 Difference]: Start difference. First operand 20338 states and 66162 transitions. Second operand 3 states. [2018-12-31 22:19:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:51,985 INFO L93 Difference]: Finished difference Result 24386 states and 77974 transitions. [2018-12-31 22:19:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:19:51,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-31 22:19:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:52,036 INFO L225 Difference]: With dead ends: 24386 [2018-12-31 22:19:52,036 INFO L226 Difference]: Without dead ends: 24386 [2018-12-31 22:19:52,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:19:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24386 states. [2018-12-31 22:19:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24386 to 21906. [2018-12-31 22:19:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21906 states. [2018-12-31 22:19:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21906 states to 21906 states and 70642 transitions. [2018-12-31 22:19:52,424 INFO L78 Accepts]: Start accepts. Automaton has 21906 states and 70642 transitions. Word has length 73 [2018-12-31 22:19:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:52,425 INFO L480 AbstractCegarLoop]: Abstraction has 21906 states and 70642 transitions. [2018-12-31 22:19:52,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:19:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21906 states and 70642 transitions. [2018-12-31 22:19:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 22:19:52,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:52,453 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] [2018-12-31 22:19:52,453 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash 449886895, now seen corresponding path program 1 times [2018-12-31 22:19:52,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:52,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:52,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:52,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:52,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:19:52,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:19:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:19:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:19:52,696 INFO L87 Difference]: Start difference. First operand 21906 states and 70642 transitions. Second operand 4 states. [2018-12-31 22:19:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:53,704 INFO L93 Difference]: Finished difference Result 33994 states and 108244 transitions. [2018-12-31 22:19:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:19:53,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-31 22:19:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:53,771 INFO L225 Difference]: With dead ends: 33994 [2018-12-31 22:19:53,771 INFO L226 Difference]: Without dead ends: 33798 [2018-12-31 22:19:53,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:19:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2018-12-31 22:19:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 28426. [2018-12-31 22:19:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28426 states. [2018-12-31 22:19:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28426 states to 28426 states and 91464 transitions. [2018-12-31 22:19:54,338 INFO L78 Accepts]: Start accepts. Automaton has 28426 states and 91464 transitions. Word has length 77 [2018-12-31 22:19:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:54,339 INFO L480 AbstractCegarLoop]: Abstraction has 28426 states and 91464 transitions. [2018-12-31 22:19:54,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:19:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 28426 states and 91464 transitions. [2018-12-31 22:19:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 22:19:54,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:54,381 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] [2018-12-31 22:19:54,381 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1694651376, now seen corresponding path program 1 times [2018-12-31 22:19:54,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:54,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:54,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:19:54,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:19:54,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:19:54,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:19:54,756 INFO L87 Difference]: Start difference. First operand 28426 states and 91464 transitions. Second operand 8 states. [2018-12-31 22:19:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:57,221 INFO L93 Difference]: Finished difference Result 43452 states and 135569 transitions. [2018-12-31 22:19:57,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:19:57,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-12-31 22:19:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:57,306 INFO L225 Difference]: With dead ends: 43452 [2018-12-31 22:19:57,306 INFO L226 Difference]: Without dead ends: 43204 [2018-12-31 22:19:57,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-31 22:19:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43204 states. [2018-12-31 22:19:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43204 to 31023. [2018-12-31 22:19:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31023 states. [2018-12-31 22:19:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31023 states to 31023 states and 99252 transitions. [2018-12-31 22:19:57,916 INFO L78 Accepts]: Start accepts. Automaton has 31023 states and 99252 transitions. Word has length 77 [2018-12-31 22:19:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:57,917 INFO L480 AbstractCegarLoop]: Abstraction has 31023 states and 99252 transitions. [2018-12-31 22:19:57,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:19:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31023 states and 99252 transitions. [2018-12-31 22:19:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 22:19:57,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:57,949 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] [2018-12-31 22:19:57,950 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 850179505, now seen corresponding path program 1 times [2018-12-31 22:19:57,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:57,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:58,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:58,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:19:58,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:19:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:19:58,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:19:58,261 INFO L87 Difference]: Start difference. First operand 31023 states and 99252 transitions. Second operand 6 states. [2018-12-31 22:19:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:19:59,138 INFO L93 Difference]: Finished difference Result 33613 states and 106498 transitions. [2018-12-31 22:19:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:19:59,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-31 22:19:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:19:59,198 INFO L225 Difference]: With dead ends: 33613 [2018-12-31 22:19:59,198 INFO L226 Difference]: Without dead ends: 33613 [2018-12-31 22:19:59,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:19:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33613 states. [2018-12-31 22:19:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33613 to 31806. [2018-12-31 22:19:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31806 states. [2018-12-31 22:19:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31806 states to 31806 states and 101445 transitions. [2018-12-31 22:19:59,734 INFO L78 Accepts]: Start accepts. Automaton has 31806 states and 101445 transitions. Word has length 77 [2018-12-31 22:19:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:19:59,735 INFO L480 AbstractCegarLoop]: Abstraction has 31806 states and 101445 transitions. [2018-12-31 22:19:59,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:19:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 31806 states and 101445 transitions. [2018-12-31 22:19:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 22:19:59,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:19:59,769 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] [2018-12-31 22:19:59,769 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:19:59,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:19:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1719306894, now seen corresponding path program 1 times [2018-12-31 22:19:59,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:19:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:19:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:59,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:19:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:19:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:19:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:19:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:19:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:19:59,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:19:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:19:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:19:59,974 INFO L87 Difference]: Start difference. First operand 31806 states and 101445 transitions. Second operand 8 states. [2018-12-31 22:20:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:01,425 INFO L93 Difference]: Finished difference Result 36250 states and 114638 transitions. [2018-12-31 22:20:01,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 22:20:01,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-12-31 22:20:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:01,506 INFO L225 Difference]: With dead ends: 36250 [2018-12-31 22:20:01,506 INFO L226 Difference]: Without dead ends: 36186 [2018-12-31 22:20:01,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-31 22:20:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36186 states. [2018-12-31 22:20:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36186 to 32526. [2018-12-31 22:20:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32526 states. [2018-12-31 22:20:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32526 states to 32526 states and 103865 transitions. [2018-12-31 22:20:02,374 INFO L78 Accepts]: Start accepts. Automaton has 32526 states and 103865 transitions. Word has length 77 [2018-12-31 22:20:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:02,375 INFO L480 AbstractCegarLoop]: Abstraction has 32526 states and 103865 transitions. [2018-12-31 22:20:02,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:20:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32526 states and 103865 transitions. [2018-12-31 22:20:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 22:20:02,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:02,422 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] [2018-12-31 22:20:02,422 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1768968179, now seen corresponding path program 1 times [2018-12-31 22:20:02,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:02,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:02,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:20:02,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:20:02,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:20:02,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:20:02,677 INFO L87 Difference]: Start difference. First operand 32526 states and 103865 transitions. Second operand 4 states. [2018-12-31 22:20:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:04,990 INFO L93 Difference]: Finished difference Result 38542 states and 121421 transitions. [2018-12-31 22:20:04,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:20:04,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-31 22:20:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:05,064 INFO L225 Difference]: With dead ends: 38542 [2018-12-31 22:20:05,065 INFO L226 Difference]: Without dead ends: 38302 [2018-12-31 22:20:05,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:20:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38302 states. [2018-12-31 22:20:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38302 to 36610. [2018-12-31 22:20:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36610 states. [2018-12-31 22:20:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36610 states to 36610 states and 115884 transitions. [2018-12-31 22:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has 36610 states and 115884 transitions. Word has length 79 [2018-12-31 22:20:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:05,736 INFO L480 AbstractCegarLoop]: Abstraction has 36610 states and 115884 transitions. [2018-12-31 22:20:05,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:20:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36610 states and 115884 transitions. [2018-12-31 22:20:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 22:20:05,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:05,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:20:05,779 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash 590338830, now seen corresponding path program 1 times [2018-12-31 22:20:05,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:05,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:05,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:20:05,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:20:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:20:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:20:05,910 INFO L87 Difference]: Start difference. First operand 36610 states and 115884 transitions. Second operand 3 states. [2018-12-31 22:20:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:06,351 INFO L93 Difference]: Finished difference Result 38602 states and 121864 transitions. [2018-12-31 22:20:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:20:06,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-12-31 22:20:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:06,430 INFO L225 Difference]: With dead ends: 38602 [2018-12-31 22:20:06,430 INFO L226 Difference]: Without dead ends: 38602 [2018-12-31 22:20:06,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:20:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38602 states. [2018-12-31 22:20:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38602 to 37598. [2018-12-31 22:20:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37598 states. [2018-12-31 22:20:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37598 states to 37598 states and 118840 transitions. [2018-12-31 22:20:07,060 INFO L78 Accepts]: Start accepts. Automaton has 37598 states and 118840 transitions. Word has length 79 [2018-12-31 22:20:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:07,061 INFO L480 AbstractCegarLoop]: Abstraction has 37598 states and 118840 transitions. [2018-12-31 22:20:07,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:20:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 37598 states and 118840 transitions. [2018-12-31 22:20:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:20:07,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:07,107 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] [2018-12-31 22:20:07,107 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 941215826, now seen corresponding path program 1 times [2018-12-31 22:20:07,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:07,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:07,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:07,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:07,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:20:07,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:20:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:20:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:20:07,370 INFO L87 Difference]: Start difference. First operand 37598 states and 118840 transitions. Second operand 5 states. [2018-12-31 22:20:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:07,832 INFO L93 Difference]: Finished difference Result 5962 states and 15305 transitions. [2018-12-31 22:20:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:20:07,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-12-31 22:20:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:07,844 INFO L225 Difference]: With dead ends: 5962 [2018-12-31 22:20:07,844 INFO L226 Difference]: Without dead ends: 4908 [2018-12-31 22:20:07,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2018-12-31 22:20:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4520. [2018-12-31 22:20:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4520 states. [2018-12-31 22:20:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 11664 transitions. [2018-12-31 22:20:07,926 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 11664 transitions. Word has length 80 [2018-12-31 22:20:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:07,926 INFO L480 AbstractCegarLoop]: Abstraction has 4520 states and 11664 transitions. [2018-12-31 22:20:07,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:20:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 11664 transitions. [2018-12-31 22:20:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 22:20:07,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:07,932 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] [2018-12-31 22:20:07,932 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 404950075, now seen corresponding path program 1 times [2018-12-31 22:20:07,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:07,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:08,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:08,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:20:08,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:20:08,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:20:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:08,084 INFO L87 Difference]: Start difference. First operand 4520 states and 11664 transitions. Second operand 7 states. [2018-12-31 22:20:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:08,466 INFO L93 Difference]: Finished difference Result 5089 states and 12746 transitions. [2018-12-31 22:20:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:20:08,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-12-31 22:20:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:08,474 INFO L225 Difference]: With dead ends: 5089 [2018-12-31 22:20:08,474 INFO L226 Difference]: Without dead ends: 4931 [2018-12-31 22:20:08,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:20:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2018-12-31 22:20:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4777. [2018-12-31 22:20:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2018-12-31 22:20:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 12151 transitions. [2018-12-31 22:20:08,530 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 12151 transitions. Word has length 90 [2018-12-31 22:20:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:08,531 INFO L480 AbstractCegarLoop]: Abstraction has 4777 states and 12151 transitions. [2018-12-31 22:20:08,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:20:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 12151 transitions. [2018-12-31 22:20:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 22:20:08,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:08,540 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] [2018-12-31 22:20:08,540 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1374531098, now seen corresponding path program 1 times [2018-12-31 22:20:08,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:08,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:08,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:08,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:08,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:20:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:20:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:20:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:20:08,774 INFO L87 Difference]: Start difference. First operand 4777 states and 12151 transitions. Second operand 5 states. [2018-12-31 22:20:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:09,025 INFO L93 Difference]: Finished difference Result 5349 states and 13474 transitions. [2018-12-31 22:20:09,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:20:09,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-31 22:20:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:09,036 INFO L225 Difference]: With dead ends: 5349 [2018-12-31 22:20:09,036 INFO L226 Difference]: Without dead ends: 5286 [2018-12-31 22:20:09,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:20:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2018-12-31 22:20:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 4795. [2018-12-31 22:20:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4795 states. [2018-12-31 22:20:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 12184 transitions. [2018-12-31 22:20:09,113 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 12184 transitions. Word has length 90 [2018-12-31 22:20:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:09,113 INFO L480 AbstractCegarLoop]: Abstraction has 4795 states and 12184 transitions. [2018-12-31 22:20:09,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:20:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 12184 transitions. [2018-12-31 22:20:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:09,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:09,119 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] [2018-12-31 22:20:09,119 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1723830517, now seen corresponding path program 1 times [2018-12-31 22:20:09,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:09,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:09,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:20:09,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:20:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:20:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:20:09,215 INFO L87 Difference]: Start difference. First operand 4795 states and 12184 transitions. Second operand 4 states. [2018-12-31 22:20:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:09,394 INFO L93 Difference]: Finished difference Result 8152 states and 21084 transitions. [2018-12-31 22:20:09,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:20:09,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 22:20:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:09,407 INFO L225 Difference]: With dead ends: 8152 [2018-12-31 22:20:09,407 INFO L226 Difference]: Without dead ends: 8122 [2018-12-31 22:20:09,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:20:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2018-12-31 22:20:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4538. [2018-12-31 22:20:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4538 states. [2018-12-31 22:20:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 11484 transitions. [2018-12-31 22:20:09,533 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 11484 transitions. Word has length 92 [2018-12-31 22:20:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:09,533 INFO L480 AbstractCegarLoop]: Abstraction has 4538 states and 11484 transitions. [2018-12-31 22:20:09,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:20:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 11484 transitions. [2018-12-31 22:20:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:09,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:09,538 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] [2018-12-31 22:20:09,539 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2018-12-31 22:20:09,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:09,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:09,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:09,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:09,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:20:09,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:20:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:20:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:09,861 INFO L87 Difference]: Start difference. First operand 4538 states and 11484 transitions. Second operand 6 states. [2018-12-31 22:20:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:10,286 INFO L93 Difference]: Finished difference Result 6142 states and 15400 transitions. [2018-12-31 22:20:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:20:10,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 22:20:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:10,295 INFO L225 Difference]: With dead ends: 6142 [2018-12-31 22:20:10,295 INFO L226 Difference]: Without dead ends: 6110 [2018-12-31 22:20:10,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2018-12-31 22:20:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 4735. [2018-12-31 22:20:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4735 states. [2018-12-31 22:20:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 11948 transitions. [2018-12-31 22:20:10,364 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 11948 transitions. Word has length 92 [2018-12-31 22:20:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:10,364 INFO L480 AbstractCegarLoop]: Abstraction has 4735 states and 11948 transitions. [2018-12-31 22:20:10,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:20:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 11948 transitions. [2018-12-31 22:20:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:10,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:10,370 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] [2018-12-31 22:20:10,370 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2018-12-31 22:20:10,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:10,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:10,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:10,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:10,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:10,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:20:10,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:20:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:20:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:10,500 INFO L87 Difference]: Start difference. First operand 4735 states and 11948 transitions. Second operand 7 states. [2018-12-31 22:20:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:11,201 INFO L93 Difference]: Finished difference Result 9486 states and 24387 transitions. [2018-12-31 22:20:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:20:11,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 22:20:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:11,216 INFO L225 Difference]: With dead ends: 9486 [2018-12-31 22:20:11,216 INFO L226 Difference]: Without dead ends: 9486 [2018-12-31 22:20:11,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-31 22:20:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9486 states. [2018-12-31 22:20:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9486 to 5205. [2018-12-31 22:20:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5205 states. [2018-12-31 22:20:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 13187 transitions. [2018-12-31 22:20:11,310 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 13187 transitions. Word has length 92 [2018-12-31 22:20:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:11,310 INFO L480 AbstractCegarLoop]: Abstraction has 5205 states and 13187 transitions. [2018-12-31 22:20:11,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:20:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 13187 transitions. [2018-12-31 22:20:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:11,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:11,316 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] [2018-12-31 22:20:11,317 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2018-12-31 22:20:11,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:11,737 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 22:20:11,961 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-12-31 22:20:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:12,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:12,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:20:12,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:20:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:20:12,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:12,009 INFO L87 Difference]: Start difference. First operand 5205 states and 13187 transitions. Second operand 7 states. [2018-12-31 22:20:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:12,395 INFO L93 Difference]: Finished difference Result 4885 states and 12402 transitions. [2018-12-31 22:20:12,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:20:12,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 22:20:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:12,404 INFO L225 Difference]: With dead ends: 4885 [2018-12-31 22:20:12,404 INFO L226 Difference]: Without dead ends: 4885 [2018-12-31 22:20:12,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:20:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2018-12-31 22:20:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4684. [2018-12-31 22:20:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-12-31 22:20:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 11957 transitions. [2018-12-31 22:20:12,461 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 11957 transitions. Word has length 92 [2018-12-31 22:20:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:12,461 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 11957 transitions. [2018-12-31 22:20:12,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:20:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 11957 transitions. [2018-12-31 22:20:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:12,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:12,467 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] [2018-12-31 22:20:12,467 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:12,467 INFO L82 PathProgramCache]: Analyzing trace with hash -124272980, now seen corresponding path program 1 times [2018-12-31 22:20:12,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:12,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:12,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:12,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:12,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:12,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:12,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:20:12,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:20:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:20:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:12,769 INFO L87 Difference]: Start difference. First operand 4684 states and 11957 transitions. Second operand 7 states. [2018-12-31 22:20:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:13,056 INFO L93 Difference]: Finished difference Result 4984 states and 12705 transitions. [2018-12-31 22:20:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:20:13,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 22:20:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:13,065 INFO L225 Difference]: With dead ends: 4984 [2018-12-31 22:20:13,065 INFO L226 Difference]: Without dead ends: 4984 [2018-12-31 22:20:13,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2018-12-31 22:20:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4649. [2018-12-31 22:20:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2018-12-31 22:20:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 11891 transitions. [2018-12-31 22:20:13,117 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 11891 transitions. Word has length 92 [2018-12-31 22:20:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:13,117 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 11891 transitions. [2018-12-31 22:20:13,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:20:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 11891 transitions. [2018-12-31 22:20:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:13,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:13,123 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] [2018-12-31 22:20:13,123 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1286606540, now seen corresponding path program 1 times [2018-12-31 22:20:13,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:13,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:13,464 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 22:20:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:13,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:20:13,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:20:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:20:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:20:13,628 INFO L87 Difference]: Start difference. First operand 4649 states and 11891 transitions. Second operand 5 states. [2018-12-31 22:20:13,854 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-12-31 22:20:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:14,047 INFO L93 Difference]: Finished difference Result 4290 states and 10980 transitions. [2018-12-31 22:20:14,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:20:14,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-31 22:20:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:14,056 INFO L225 Difference]: With dead ends: 4290 [2018-12-31 22:20:14,056 INFO L226 Difference]: Without dead ends: 4290 [2018-12-31 22:20:14,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2018-12-31 22:20:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 4207. [2018-12-31 22:20:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4207 states. [2018-12-31 22:20:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 10814 transitions. [2018-12-31 22:20:14,106 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 10814 transitions. Word has length 92 [2018-12-31 22:20:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:14,107 INFO L480 AbstractCegarLoop]: Abstraction has 4207 states and 10814 transitions. [2018-12-31 22:20:14,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:20:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 10814 transitions. [2018-12-31 22:20:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:20:14,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:14,112 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] [2018-12-31 22:20:14,112 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash -649053747, now seen corresponding path program 1 times [2018-12-31 22:20:14,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:14,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:14,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:20:14,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:20:14,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:20:14,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:14,329 INFO L87 Difference]: Start difference. First operand 4207 states and 10814 transitions. Second operand 6 states. [2018-12-31 22:20:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:14,434 INFO L93 Difference]: Finished difference Result 3839 states and 9622 transitions. [2018-12-31 22:20:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:20:14,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 22:20:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:14,441 INFO L225 Difference]: With dead ends: 3839 [2018-12-31 22:20:14,441 INFO L226 Difference]: Without dead ends: 3839 [2018-12-31 22:20:14,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2018-12-31 22:20:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3059. [2018-12-31 22:20:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2018-12-31 22:20:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 7774 transitions. [2018-12-31 22:20:14,481 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 7774 transitions. Word has length 92 [2018-12-31 22:20:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:14,481 INFO L480 AbstractCegarLoop]: Abstraction has 3059 states and 7774 transitions. [2018-12-31 22:20:14,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:20:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 7774 transitions. [2018-12-31 22:20:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:14,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:14,485 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] [2018-12-31 22:20:14,485 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1808878702, now seen corresponding path program 1 times [2018-12-31 22:20:14,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:14,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:14,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:14,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:14,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:20:14,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:20:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:20:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:14,648 INFO L87 Difference]: Start difference. First operand 3059 states and 7774 transitions. Second operand 7 states. [2018-12-31 22:20:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:15,184 INFO L93 Difference]: Finished difference Result 4681 states and 11656 transitions. [2018-12-31 22:20:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:20:15,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 22:20:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:15,192 INFO L225 Difference]: With dead ends: 4681 [2018-12-31 22:20:15,192 INFO L226 Difference]: Without dead ends: 4681 [2018-12-31 22:20:15,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:20:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2018-12-31 22:20:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 3409. [2018-12-31 22:20:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2018-12-31 22:20:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 8632 transitions. [2018-12-31 22:20:15,240 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 8632 transitions. Word has length 94 [2018-12-31 22:20:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:15,240 INFO L480 AbstractCegarLoop]: Abstraction has 3409 states and 8632 transitions. [2018-12-31 22:20:15,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:20:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 8632 transitions. [2018-12-31 22:20:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:15,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:15,245 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] [2018-12-31 22:20:15,245 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1241324113, now seen corresponding path program 1 times [2018-12-31 22:20:15,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:15,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:15,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:15,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:20:15,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:20:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:20:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:15,400 INFO L87 Difference]: Start difference. First operand 3409 states and 8632 transitions. Second operand 6 states. [2018-12-31 22:20:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:15,549 INFO L93 Difference]: Finished difference Result 3543 states and 8861 transitions. [2018-12-31 22:20:15,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:20:15,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:20:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:15,563 INFO L225 Difference]: With dead ends: 3543 [2018-12-31 22:20:15,563 INFO L226 Difference]: Without dead ends: 3543 [2018-12-31 22:20:15,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:20:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2018-12-31 22:20:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3409. [2018-12-31 22:20:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2018-12-31 22:20:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 8607 transitions. [2018-12-31 22:20:15,605 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 8607 transitions. Word has length 94 [2018-12-31 22:20:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:15,605 INFO L480 AbstractCegarLoop]: Abstraction has 3409 states and 8607 transitions. [2018-12-31 22:20:15,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:20:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 8607 transitions. [2018-12-31 22:20:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:15,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:15,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:20:15,610 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2138644463, now seen corresponding path program 1 times [2018-12-31 22:20:15,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:15,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:15,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:15,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:15,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:20:15,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:20:15,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:20:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:20:15,990 INFO L87 Difference]: Start difference. First operand 3409 states and 8607 transitions. Second operand 5 states. [2018-12-31 22:20:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:16,329 INFO L93 Difference]: Finished difference Result 3857 states and 9711 transitions. [2018-12-31 22:20:16,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:20:16,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:20:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:16,338 INFO L225 Difference]: With dead ends: 3857 [2018-12-31 22:20:16,338 INFO L226 Difference]: Without dead ends: 3825 [2018-12-31 22:20:16,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2018-12-31 22:20:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2885. [2018-12-31 22:20:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2885 states. [2018-12-31 22:20:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 7322 transitions. [2018-12-31 22:20:16,378 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 7322 transitions. Word has length 94 [2018-12-31 22:20:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:16,378 INFO L480 AbstractCegarLoop]: Abstraction has 2885 states and 7322 transitions. [2018-12-31 22:20:16,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:20:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 7322 transitions. [2018-12-31 22:20:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:16,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:16,382 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] [2018-12-31 22:20:16,382 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash -911558352, now seen corresponding path program 1 times [2018-12-31 22:20:16,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:16,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:16,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:16,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:16,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:20:16,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:20:16,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:20:16,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:20:16,656 INFO L87 Difference]: Start difference. First operand 2885 states and 7322 transitions. Second operand 10 states. [2018-12-31 22:20:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:17,183 INFO L93 Difference]: Finished difference Result 4730 states and 12190 transitions. [2018-12-31 22:20:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:20:17,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-12-31 22:20:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:17,188 INFO L225 Difference]: With dead ends: 4730 [2018-12-31 22:20:17,189 INFO L226 Difference]: Without dead ends: 1879 [2018-12-31 22:20:17,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:20:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-12-31 22:20:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1879. [2018-12-31 22:20:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2018-12-31 22:20:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4915 transitions. [2018-12-31 22:20:17,212 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4915 transitions. Word has length 94 [2018-12-31 22:20:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:17,212 INFO L480 AbstractCegarLoop]: Abstraction has 1879 states and 4915 transitions. [2018-12-31 22:20:17,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:20:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4915 transitions. [2018-12-31 22:20:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:17,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:17,215 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] [2018-12-31 22:20:17,215 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash 220287440, now seen corresponding path program 1 times [2018-12-31 22:20:17,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:17,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:17,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:17,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:17,522 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-31 22:20:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:17,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:17,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:20:17,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:20:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:20:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:17,634 INFO L87 Difference]: Start difference. First operand 1879 states and 4915 transitions. Second operand 6 states. [2018-12-31 22:20:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:17,942 INFO L93 Difference]: Finished difference Result 2123 states and 5462 transitions. [2018-12-31 22:20:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:20:17,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:20:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:17,947 INFO L225 Difference]: With dead ends: 2123 [2018-12-31 22:20:17,947 INFO L226 Difference]: Without dead ends: 2123 [2018-12-31 22:20:17,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:20:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2018-12-31 22:20:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1906. [2018-12-31 22:20:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2018-12-31 22:20:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 4970 transitions. [2018-12-31 22:20:17,973 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 4970 transitions. Word has length 94 [2018-12-31 22:20:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:17,973 INFO L480 AbstractCegarLoop]: Abstraction has 1906 states and 4970 transitions. [2018-12-31 22:20:17,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:20:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 4970 transitions. [2018-12-31 22:20:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:17,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:17,976 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] [2018-12-31 22:20:17,976 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash 550053201, now seen corresponding path program 1 times [2018-12-31 22:20:17,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:17,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:17,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:17,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:20:18,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:20:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:20:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:18,101 INFO L87 Difference]: Start difference. First operand 1906 states and 4970 transitions. Second operand 6 states. [2018-12-31 22:20:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:18,251 INFO L93 Difference]: Finished difference Result 1965 states and 5079 transitions. [2018-12-31 22:20:18,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:20:18,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:20:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:18,256 INFO L225 Difference]: With dead ends: 1965 [2018-12-31 22:20:18,257 INFO L226 Difference]: Without dead ends: 1949 [2018-12-31 22:20:18,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:20:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2018-12-31 22:20:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1879. [2018-12-31 22:20:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2018-12-31 22:20:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4907 transitions. [2018-12-31 22:20:18,280 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4907 transitions. Word has length 94 [2018-12-31 22:20:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:18,280 INFO L480 AbstractCegarLoop]: Abstraction has 1879 states and 4907 transitions. [2018-12-31 22:20:18,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:20:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4907 transitions. [2018-12-31 22:20:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:18,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:18,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] [2018-12-31 22:20:18,283 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:18,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1480453039, now seen corresponding path program 1 times [2018-12-31 22:20:18,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:18,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:20:18,852 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 22:20:19,197 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 22:20:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:20:19,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:20:19,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:20:19,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:20:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:20:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:20:19,215 INFO L87 Difference]: Start difference. First operand 1879 states and 4907 transitions. Second operand 6 states. [2018-12-31 22:20:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:20:19,612 INFO L93 Difference]: Finished difference Result 1921 states and 4983 transitions. [2018-12-31 22:20:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:20:19,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:20:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:20:19,616 INFO L225 Difference]: With dead ends: 1921 [2018-12-31 22:20:19,616 INFO L226 Difference]: Without dead ends: 1921 [2018-12-31 22:20:19,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:20:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-12-31 22:20:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1914. [2018-12-31 22:20:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2018-12-31 22:20:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4970 transitions. [2018-12-31 22:20:19,641 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4970 transitions. Word has length 94 [2018-12-31 22:20:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:20:19,641 INFO L480 AbstractCegarLoop]: Abstraction has 1914 states and 4970 transitions. [2018-12-31 22:20:19,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:20:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4970 transitions. [2018-12-31 22:20:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:20:19,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:20:19,644 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] [2018-12-31 22:20:19,644 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:20:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:20:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1150687278, now seen corresponding path program 2 times [2018-12-31 22:20:19,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:20:19,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:20:19,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:19,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:20:19,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:20:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:20:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:20:19,732 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:20:19,894 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:20:19,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:20:19 BasicIcfg [2018-12-31 22:20:19,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:20:19,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:20:19,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:20:19,899 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:20:19,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:19:31" (3/4) ... [2018-12-31 22:20:19,904 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:20:20,085 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:20:20,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:20:20,088 INFO L168 Benchmark]: Toolchain (without parser) took 51160.63 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -75.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-31 22:20:20,091 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:20:20,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:20:20,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.87 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:20:20,092 INFO L168 Benchmark]: Boogie Preprocessor took 83.24 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. [2018-12-31 22:20:20,101 INFO L168 Benchmark]: RCFGBuilder took 1367.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-12-31 22:20:20,101 INFO L168 Benchmark]: TraceAbstraction took 48515.55 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-31 22:20:20,102 INFO L168 Benchmark]: Witness Printer took 189.07 ms. Allocated memory is still 2.9 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-31 22:20:20,110 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 903.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.87 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.24 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 1367.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48515.55 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 189.07 ms. Allocated memory is still 2.9 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1455; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1456; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 48.3s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 26.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7793 SDtfs, 7740 SDslu, 17173 SDs, 0 SdLazy, 8379 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 84 SyntacticMatches, 19 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37598occurred in iteration=14, 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: 10.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 103197 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2560 NumberOfCodeBlocks, 2560 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2435 ConstructedInterpolants, 0 QuantifiedInterpolants, 499317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...