./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer --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 c1f9c3d1c44dc25378b363cd225ab320ff5e52b6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-02 13:49:42,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:49:42,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:49:42,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:49:42,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:49:42,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:49:42,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:49:42,814 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:49:42,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:49:42,816 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:49:42,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:49:42,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:49:42,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:49:42,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:49:42,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:49:42,820 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:49:42,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:49:42,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:49:42,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:49:42,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:49:42,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:49:42,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:49:42,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:49:42,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:49:42,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:49:42,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:49:42,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:49:42,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:49:42,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:49:42,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:49:42,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:49:42,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:49:42,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:49:42,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:49:42,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:49:42,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:49:42,834 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 13:49:42,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:49:42,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:49:42,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:49:42,845 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:49:42,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 13:49:42,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 13:49:42,845 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 13:49:42,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:49:42,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:49:42,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:49:42,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:49:42,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:49:42,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:49:42,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:49:42,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 13:49:42,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:49:42,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 13:49:42,848 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer 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 -> c1f9c3d1c44dc25378b363cd225ab320ff5e52b6 [2018-12-02 13:49:42,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:49:42,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:49:42,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:49:42,877 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:49:42,878 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:49:42,878 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i [2018-12-02 13:49:42,916 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/data/094a4c876/cf0d30d88d7c4dd8a2525edbb0b34793/FLAG327a20e3f [2018-12-02 13:49:43,356 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:49:43,356 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i [2018-12-02 13:49:43,363 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/data/094a4c876/cf0d30d88d7c4dd8a2525edbb0b34793/FLAG327a20e3f [2018-12-02 13:49:43,372 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/data/094a4c876/cf0d30d88d7c4dd8a2525edbb0b34793 [2018-12-02 13:49:43,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:49:43,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:49:43,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:49:43,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:49:43,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:49:43,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43, skipping insertion in model container [2018-12-02 13:49:43,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:49:43,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:49:43,581 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:49:43,589 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:49:43,672 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:49:43,701 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:49:43,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43 WrapperNode [2018-12-02 13:49:43,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:49:43,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:49:43,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:49:43,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:49:43,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:49:43,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:49:43,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:49:43,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:49:43,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... [2018-12-02 13:49:43,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:49:43,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:49:43,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:49:43,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:49:43,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/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-02 13:49:43,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:49:43,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 13:49:43,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 13:49:43,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 13:49:43,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 13:49:43,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 13:49:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 13:49:43,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 13:49:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 13:49:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:49:43,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:49:43,793 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 13:49:44,102 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:49:44,102 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 13:49:44,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:49:44 BoogieIcfgContainer [2018-12-02 13:49:44,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:49:44,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 13:49:44,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 13:49:44,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 13:49:44,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:49:43" (1/3) ... [2018-12-02 13:49:44,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a97ce22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:49:44, skipping insertion in model container [2018-12-02 13:49:44,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:49:43" (2/3) ... [2018-12-02 13:49:44,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a97ce22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:49:44, skipping insertion in model container [2018-12-02 13:49:44,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:49:44" (3/3) ... [2018-12-02 13:49:44,108 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc_false-unreach-call.i [2018-12-02 13:49:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,136 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,136 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,136 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,136 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,137 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,143 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 13:49:44,164 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 13:49:44,164 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 13:49:44,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 13:49:44,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 13:49:44,195 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 13:49:44,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 13:49:44,195 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 13:49:44,195 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 13:49:44,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:49:44,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:49:44,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 13:49:44,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:49:44,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 13:49:44,204 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 13:49:45,642 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 13:49:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 13:49:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 13:49:45,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:45,649 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] [2018-12-02 13:49:45,650 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-12-02 13:49:45,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:45,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:45,786 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-02 13:49:45,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:45,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:45,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:45,799 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 13:49:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:46,260 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 13:49:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:49:46,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 13:49:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:46,415 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 13:49:46,416 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 13:49:46,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 13:49:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 13:49:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 13:49:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 13:49:47,243 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 13:49:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:47,244 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 13:49:47,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 13:49:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 13:49:47,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:47,248 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] [2018-12-02 13:49:47,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:47,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-12-02 13:49:47,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:47,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:47,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:47,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:47,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:47,287 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-02 13:49:47,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:47,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:49:47,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:49:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:49:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:49:47,288 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-02 13:49:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:47,474 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-02 13:49:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:49:47,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 13:49:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:47,556 INFO L225 Difference]: With dead ends: 27339 [2018-12-02 13:49:47,556 INFO L226 Difference]: Without dead ends: 27339 [2018-12-02 13:49:47,557 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-02 13:49:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-02 13:49:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-02 13:49:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 13:49:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-02 13:49:48,074 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-02 13:49:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:48,075 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-02 13:49:48,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:49:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-02 13:49:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 13:49:48,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:48,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:49:48,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:48,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-12-02 13:49:48,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:48,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:48,134 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-02 13:49:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:48,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:48,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:48,136 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 4 states. [2018-12-02 13:49:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:48,181 INFO L93 Difference]: Finished difference Result 8529 states and 28321 transitions. [2018-12-02 13:49:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:49:48,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 13:49:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:48,193 INFO L225 Difference]: With dead ends: 8529 [2018-12-02 13:49:48,193 INFO L226 Difference]: Without dead ends: 7467 [2018-12-02 13:49:48,193 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-02 13:49:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-12-02 13:49:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-12-02 13:49:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-12-02 13:49:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24613 transitions. [2018-12-02 13:49:48,280 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24613 transitions. Word has length 46 [2018-12-02 13:49:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24613 transitions. [2018-12-02 13:49:48,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24613 transitions. [2018-12-02 13:49:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 13:49:48,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:48,282 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] [2018-12-02 13:49:48,282 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:48,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-12-02 13:49:48,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:48,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:48,336 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-02 13:49:48,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:48,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:48,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:48,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:48,336 INFO L87 Difference]: Start difference. First operand 7467 states and 24613 transitions. Second operand 5 states. [2018-12-02 13:49:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:48,576 INFO L93 Difference]: Finished difference Result 13999 states and 45774 transitions. [2018-12-02 13:49:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:48,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 13:49:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:48,593 INFO L225 Difference]: With dead ends: 13999 [2018-12-02 13:49:48,593 INFO L226 Difference]: Without dead ends: 13931 [2018-12-02 13:49:48,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:49:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-12-02 13:49:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-12-02 13:49:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-12-02 13:49:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30519 transitions. [2018-12-02 13:49:48,730 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30519 transitions. Word has length 47 [2018-12-02 13:49:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:48,731 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30519 transitions. [2018-12-02 13:49:48,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30519 transitions. [2018-12-02 13:49:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 13:49:48,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:48,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:49:48,733 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:48,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-12-02 13:49:48,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:48,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:48,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:48,757 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-02 13:49:48,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:48,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:49:48,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:49:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:49:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:49:48,758 INFO L87 Difference]: Start difference. First operand 9442 states and 30519 transitions. Second operand 3 states. [2018-12-02 13:49:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:48,818 INFO L93 Difference]: Finished difference Result 13280 states and 42594 transitions. [2018-12-02 13:49:48,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:49:48,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 13:49:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:48,835 INFO L225 Difference]: With dead ends: 13280 [2018-12-02 13:49:48,835 INFO L226 Difference]: Without dead ends: 13280 [2018-12-02 13:49:48,835 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-02 13:49:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-12-02 13:49:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-12-02 13:49:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-12-02 13:49:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31485 transitions. [2018-12-02 13:49:48,952 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31485 transitions. Word has length 49 [2018-12-02 13:49:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:48,952 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31485 transitions. [2018-12-02 13:49:48,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:49:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31485 transitions. [2018-12-02 13:49:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 13:49:48,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:48,953 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] [2018-12-02 13:49:48,953 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:48,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:48,954 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-12-02 13:49:48,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:48,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:48,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:48,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:49,012 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-02 13:49:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:49:49,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:49:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:49:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:49:49,013 INFO L87 Difference]: Start difference. First operand 9846 states and 31485 transitions. Second operand 6 states. [2018-12-02 13:49:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:49,256 INFO L93 Difference]: Finished difference Result 14204 states and 45033 transitions. [2018-12-02 13:49:49,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:49:49,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 13:49:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:49,272 INFO L225 Difference]: With dead ends: 14204 [2018-12-02 13:49:49,272 INFO L226 Difference]: Without dead ends: 14132 [2018-12-02 13:49:49,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 13:49:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-12-02 13:49:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-12-02 13:49:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-12-02 13:49:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34540 transitions. [2018-12-02 13:49:49,389 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34540 transitions. Word has length 53 [2018-12-02 13:49:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:49,389 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34540 transitions. [2018-12-02 13:49:49,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:49:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34540 transitions. [2018-12-02 13:49:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 13:49:49,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:49,393 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] [2018-12-02 13:49:49,393 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:49,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-12-02 13:49:49,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:49,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:49,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:49,449 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-02 13:49:49,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:49,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:49,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:49,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:49,450 INFO L87 Difference]: Start difference. First operand 10850 states and 34540 transitions. Second operand 4 states. [2018-12-02 13:49:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:49,528 INFO L93 Difference]: Finished difference Result 12397 states and 39549 transitions. [2018-12-02 13:49:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:49:49,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 13:49:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:49,543 INFO L225 Difference]: With dead ends: 12397 [2018-12-02 13:49:49,543 INFO L226 Difference]: Without dead ends: 12397 [2018-12-02 13:49:49,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-12-02 13:49:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-12-02 13:49:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-12-02 13:49:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36213 transitions. [2018-12-02 13:49:49,673 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36213 transitions. Word has length 61 [2018-12-02 13:49:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:49,674 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36213 transitions. [2018-12-02 13:49:49,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36213 transitions. [2018-12-02 13:49:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 13:49:49,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:49,679 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] [2018-12-02 13:49:49,679 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:49,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-12-02 13:49:49,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:49,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:49,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:49,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:49,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:49,803 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-02 13:49:49,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:49,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:49:49,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:49:49,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:49:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:49:49,804 INFO L87 Difference]: Start difference. First operand 11370 states and 36213 transitions. Second operand 6 states. [2018-12-02 13:49:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:50,054 INFO L93 Difference]: Finished difference Result 20970 states and 66431 transitions. [2018-12-02 13:49:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:49:50,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 13:49:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:50,078 INFO L225 Difference]: With dead ends: 20970 [2018-12-02 13:49:50,078 INFO L226 Difference]: Without dead ends: 20899 [2018-12-02 13:49:50,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:49:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-12-02 13:49:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-12-02 13:49:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-02 13:49:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43245 transitions. [2018-12-02 13:49:50,257 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43245 transitions. Word has length 61 [2018-12-02 13:49:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:50,257 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43245 transitions. [2018-12-02 13:49:50,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:49:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43245 transitions. [2018-12-02 13:49:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 13:49:50,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:50,262 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] [2018-12-02 13:49:50,262 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:50,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1028189126, now seen corresponding path program 1 times [2018-12-02 13:49:50,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:50,301 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-02 13:49:50,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:50,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:49:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:49:50,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:49:50,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:49:50,302 INFO L87 Difference]: Start difference. First operand 13756 states and 43245 transitions. Second operand 3 states. [2018-12-02 13:49:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:50,455 INFO L93 Difference]: Finished difference Result 14388 states and 44945 transitions. [2018-12-02 13:49:50,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:49:50,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 13:49:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:50,472 INFO L225 Difference]: With dead ends: 14388 [2018-12-02 13:49:50,472 INFO L226 Difference]: Without dead ends: 14388 [2018-12-02 13:49:50,472 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-02 13:49:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-12-02 13:49:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-12-02 13:49:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-12-02 13:49:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44095 transitions. [2018-12-02 13:49:50,619 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44095 transitions. Word has length 65 [2018-12-02 13:49:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:50,619 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44095 transitions. [2018-12-02 13:49:50,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:49:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44095 transitions. [2018-12-02 13:49:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 13:49:50,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:50,623 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] [2018-12-02 13:49:50,624 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:50,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:50,624 INFO L82 PathProgramCache]: Analyzing trace with hash -836115771, now seen corresponding path program 1 times [2018-12-02 13:49:50,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:50,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:50,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:50,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:50,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:50,662 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-02 13:49:50,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:50,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:50,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:50,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:50,663 INFO L87 Difference]: Start difference. First operand 14072 states and 44095 transitions. Second operand 4 states. [2018-12-02 13:49:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:50,833 INFO L93 Difference]: Finished difference Result 17952 states and 55400 transitions. [2018-12-02 13:49:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:49:50,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 13:49:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:50,853 INFO L225 Difference]: With dead ends: 17952 [2018-12-02 13:49:50,853 INFO L226 Difference]: Without dead ends: 17952 [2018-12-02 13:49:50,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-12-02 13:49:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-12-02 13:49:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-12-02 13:49:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49946 transitions. [2018-12-02 13:49:51,071 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49946 transitions. Word has length 65 [2018-12-02 13:49:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:51,071 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49946 transitions. [2018-12-02 13:49:51,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49946 transitions. [2018-12-02 13:49:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:51,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:51,075 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] [2018-12-02 13:49:51,076 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:51,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1637753329, now seen corresponding path program 1 times [2018-12-02 13:49:51,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:51,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:51,126 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-02 13:49:51,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:51,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:49:51,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:49:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:49:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:49:51,126 INFO L87 Difference]: Start difference. First operand 16110 states and 49946 transitions. Second operand 6 states. [2018-12-02 13:49:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:51,633 INFO L93 Difference]: Finished difference Result 19822 states and 60382 transitions. [2018-12-02 13:49:51,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:51,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 13:49:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:51,654 INFO L225 Difference]: With dead ends: 19822 [2018-12-02 13:49:51,655 INFO L226 Difference]: Without dead ends: 19822 [2018-12-02 13:49:51,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-12-02 13:49:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-12-02 13:49:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-12-02 13:49:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57170 transitions. [2018-12-02 13:49:51,841 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57170 transitions. Word has length 67 [2018-12-02 13:49:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:51,842 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57170 transitions. [2018-12-02 13:49:51,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:49:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57170 transitions. [2018-12-02 13:49:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:51,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:51,848 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] [2018-12-02 13:49:51,848 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:51,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash 580004624, now seen corresponding path program 1 times [2018-12-02 13:49:51,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:51,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:51,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:51,911 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-02 13:49:51,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:51,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:49:51,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:49:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:49:51,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:49:51,912 INFO L87 Difference]: Start difference. First operand 18618 states and 57170 transitions. Second operand 6 states. [2018-12-02 13:49:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:52,177 INFO L93 Difference]: Finished difference Result 21450 states and 63579 transitions. [2018-12-02 13:49:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 13:49:52,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 13:49:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:52,199 INFO L225 Difference]: With dead ends: 21450 [2018-12-02 13:49:52,199 INFO L226 Difference]: Without dead ends: 21450 [2018-12-02 13:49:52,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:49:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-12-02 13:49:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-12-02 13:49:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-12-02 13:49:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57717 transitions. [2018-12-02 13:49:52,396 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57717 transitions. Word has length 67 [2018-12-02 13:49:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:52,396 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57717 transitions. [2018-12-02 13:49:52,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:49:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57717 transitions. [2018-12-02 13:49:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:52,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:52,403 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] [2018-12-02 13:49:52,403 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:52,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash 791355537, now seen corresponding path program 1 times [2018-12-02 13:49:52,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:52,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:52,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:52,449 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-02 13:49:52,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:52,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:52,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:52,450 INFO L87 Difference]: Start difference. First operand 19134 states and 57717 transitions. Second operand 5 states. [2018-12-02 13:49:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:52,673 INFO L93 Difference]: Finished difference Result 25025 states and 74971 transitions. [2018-12-02 13:49:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:52,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 13:49:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:52,704 INFO L225 Difference]: With dead ends: 25025 [2018-12-02 13:49:52,705 INFO L226 Difference]: Without dead ends: 25025 [2018-12-02 13:49:52,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-12-02 13:49:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-12-02 13:49:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-12-02 13:49:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 67985 transitions. [2018-12-02 13:49:53,051 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 67985 transitions. Word has length 67 [2018-12-02 13:49:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:53,051 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 67985 transitions. [2018-12-02 13:49:53,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 67985 transitions. [2018-12-02 13:49:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:53,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:53,058 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] [2018-12-02 13:49:53,058 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:53,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 280821360, now seen corresponding path program 1 times [2018-12-02 13:49:53,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:53,106 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-02 13:49:53,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:53,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:53,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:53,107 INFO L87 Difference]: Start difference. First operand 22710 states and 67985 transitions. Second operand 5 states. [2018-12-02 13:49:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:53,435 INFO L93 Difference]: Finished difference Result 31960 states and 94824 transitions. [2018-12-02 13:49:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:49:53,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 13:49:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:53,470 INFO L225 Difference]: With dead ends: 31960 [2018-12-02 13:49:53,470 INFO L226 Difference]: Without dead ends: 31960 [2018-12-02 13:49:53,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:49:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-12-02 13:49:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-12-02 13:49:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-12-02 13:49:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84212 transitions. [2018-12-02 13:49:53,774 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84212 transitions. Word has length 67 [2018-12-02 13:49:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:53,775 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84212 transitions. [2018-12-02 13:49:53,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84212 transitions. [2018-12-02 13:49:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:53,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:53,783 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] [2018-12-02 13:49:53,783 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:53,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1526633103, now seen corresponding path program 1 times [2018-12-02 13:49:53,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:53,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:53,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:53,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:53,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:53,819 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-02 13:49:53,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:53,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:53,820 INFO L87 Difference]: Start difference. First operand 28240 states and 84212 transitions. Second operand 4 states. [2018-12-02 13:49:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:54,181 INFO L93 Difference]: Finished difference Result 38784 states and 116172 transitions. [2018-12-02 13:49:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:49:54,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 13:49:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:54,226 INFO L225 Difference]: With dead ends: 38784 [2018-12-02 13:49:54,226 INFO L226 Difference]: Without dead ends: 38552 [2018-12-02 13:49:54,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38552 states. [2018-12-02 13:49:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38552 to 35692. [2018-12-02 13:49:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35692 states. [2018-12-02 13:49:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35692 states to 35692 states and 106997 transitions. [2018-12-02 13:49:54,615 INFO L78 Accepts]: Start accepts. Automaton has 35692 states and 106997 transitions. Word has length 67 [2018-12-02 13:49:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:54,615 INFO L480 AbstractCegarLoop]: Abstraction has 35692 states and 106997 transitions. [2018-12-02 13:49:54,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 35692 states and 106997 transitions. [2018-12-02 13:49:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:54,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:54,623 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] [2018-12-02 13:49:54,624 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:54,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash 971382834, now seen corresponding path program 1 times [2018-12-02 13:49:54,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:54,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:54,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:54,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-02 13:49:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:54,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:54,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:54,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:54,656 INFO L87 Difference]: Start difference. First operand 35692 states and 106997 transitions. Second operand 5 states. [2018-12-02 13:49:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:54,724 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-02 13:49:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:49:54,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 13:49:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:54,728 INFO L225 Difference]: With dead ends: 9316 [2018-12-02 13:49:54,729 INFO L226 Difference]: Without dead ends: 7464 [2018-12-02 13:49:54,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-02 13:49:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-02 13:49:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-02 13:49:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-02 13:49:54,775 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-02 13:49:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:54,775 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-02 13:49:54,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-02 13:49:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 13:49:54,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:54,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] [2018-12-02 13:49:54,779 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:54,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-12-02 13:49:54,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:54,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:54,798 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-02 13:49:54,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:54,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:49:54,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:49:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:49:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:49:54,799 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-02 13:49:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:54,829 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-02 13:49:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:49:54,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 13:49:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:54,836 INFO L225 Difference]: With dead ends: 8820 [2018-12-02 13:49:54,836 INFO L226 Difference]: Without dead ends: 8820 [2018-12-02 13:49:54,836 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-02 13:49:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-02 13:49:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-02 13:49:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-02 13:49:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-02 13:49:54,888 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-02 13:49:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:54,888 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-02 13:49:54,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:49:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-02 13:49:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 13:49:54,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:54,892 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-02 13:49:54,892 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:54,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-12-02 13:49:54,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:54,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:54,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:54,933 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-02 13:49:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:54,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:54,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:54,934 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-02 13:49:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:55,035 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-02 13:49:55,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 13:49:55,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 13:49:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:55,040 INFO L225 Difference]: With dead ends: 7470 [2018-12-02 13:49:55,040 INFO L226 Difference]: Without dead ends: 7470 [2018-12-02 13:49:55,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:49:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-02 13:49:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-02 13:49:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-02 13:49:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-02 13:49:55,087 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-02 13:49:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:55,088 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-02 13:49:55,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-02 13:49:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 13:49:55,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:55,092 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-02 13:49:55,092 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:55,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-12-02 13:49:55,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:55,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:55,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:55,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:55,135 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-02 13:49:55,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:55,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:49:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:49:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:49:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:55,136 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-02 13:49:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:55,349 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-02 13:49:55,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 13:49:55,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 13:49:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:55,354 INFO L225 Difference]: With dead ends: 7881 [2018-12-02 13:49:55,355 INFO L226 Difference]: Without dead ends: 7762 [2018-12-02 13:49:55,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 13:49:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-02 13:49:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-02 13:49:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-02 13:49:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-02 13:49:55,405 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-02 13:49:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:55,405 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-02 13:49:55,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:49:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-02 13:49:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 13:49:55,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:55,409 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-02 13:49:55,410 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:55,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1588401736, now seen corresponding path program 1 times [2018-12-02 13:49:55,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:55,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:55,452 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-02 13:49:55,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:55,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:55,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:55,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:55,453 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-02 13:49:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:55,612 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-02 13:49:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:49:55,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 13:49:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:55,620 INFO L225 Difference]: With dead ends: 10608 [2018-12-02 13:49:55,620 INFO L226 Difference]: Without dead ends: 10608 [2018-12-02 13:49:55,620 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-02 13:49:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-02 13:49:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-02 13:49:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-02 13:49:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-02 13:49:55,684 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-02 13:49:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:55,684 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-02 13:49:55,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-02 13:49:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 13:49:55,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:55,690 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-02 13:49:55,690 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:55,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash -627466390, now seen corresponding path program 2 times [2018-12-02 13:49:55,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:55,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:49:55,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:55,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:49:55,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:49:55,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:49:55,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:49:55,734 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-02 13:49:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:55,798 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-02 13:49:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:49:55,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 13:49:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:55,804 INFO L225 Difference]: With dead ends: 8526 [2018-12-02 13:49:55,804 INFO L226 Difference]: Without dead ends: 8526 [2018-12-02 13:49:55,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-02 13:49:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-02 13:49:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-02 13:49:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-02 13:49:55,861 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-02 13:49:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:55,862 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-02 13:49:55,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:49:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-02 13:49:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:55,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:55,867 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-02 13:49:55,867 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:55,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash 402565006, now seen corresponding path program 1 times [2018-12-02 13:49:55,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:55,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:55,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:49:55,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:55,941 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-02 13:49:55,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:55,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:49:55,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:49:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:49:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:55,942 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 7 states. [2018-12-02 13:49:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:56,226 INFO L93 Difference]: Finished difference Result 9705 states and 21992 transitions. [2018-12-02 13:49:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:56,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 13:49:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:56,232 INFO L225 Difference]: With dead ends: 9705 [2018-12-02 13:49:56,232 INFO L226 Difference]: Without dead ends: 9705 [2018-12-02 13:49:56,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2018-12-02 13:49:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 7979. [2018-12-02 13:49:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2018-12-02 13:49:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 18204 transitions. [2018-12-02 13:49:56,293 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 18204 transitions. Word has length 94 [2018-12-02 13:49:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:56,293 INFO L480 AbstractCegarLoop]: Abstraction has 7979 states and 18204 transitions. [2018-12-02 13:49:56,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:49:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 18204 transitions. [2018-12-02 13:49:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:56,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:56,298 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-02 13:49:56,298 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:56,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:56,299 INFO L82 PathProgramCache]: Analyzing trace with hash -431677389, now seen corresponding path program 1 times [2018-12-02 13:49:56,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:56,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:49:56,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:56,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:56,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:56,327 INFO L87 Difference]: Start difference. First operand 7979 states and 18204 transitions. Second operand 5 states. [2018-12-02 13:49:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:56,385 INFO L93 Difference]: Finished difference Result 8886 states and 20162 transitions. [2018-12-02 13:49:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:56,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 13:49:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:56,391 INFO L225 Difference]: With dead ends: 8886 [2018-12-02 13:49:56,391 INFO L226 Difference]: Without dead ends: 8886 [2018-12-02 13:49:56,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2018-12-02 13:49:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 6875. [2018-12-02 13:49:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-12-02 13:49:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 15723 transitions. [2018-12-02 13:49:56,444 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 15723 transitions. Word has length 94 [2018-12-02 13:49:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 15723 transitions. [2018-12-02 13:49:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 15723 transitions. [2018-12-02 13:49:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:56,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:56,448 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-02 13:49:56,449 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:56,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash -686413934, now seen corresponding path program 1 times [2018-12-02 13:49:56,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:56,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:56,485 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-02 13:49:56,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:56,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:49:56,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:49:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:49:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:49:56,486 INFO L87 Difference]: Start difference. First operand 6875 states and 15723 transitions. Second operand 5 states. [2018-12-02 13:49:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:56,659 INFO L93 Difference]: Finished difference Result 8123 states and 18363 transitions. [2018-12-02 13:49:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:49:56,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 13:49:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:56,664 INFO L225 Difference]: With dead ends: 8123 [2018-12-02 13:49:56,664 INFO L226 Difference]: Without dead ends: 7992 [2018-12-02 13:49:56,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-12-02 13:49:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7614. [2018-12-02 13:49:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-02 13:49:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17342 transitions. [2018-12-02 13:49:56,716 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17342 transitions. Word has length 94 [2018-12-02 13:49:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:56,717 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17342 transitions. [2018-12-02 13:49:56,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:49:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17342 transitions. [2018-12-02 13:49:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:56,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:56,722 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-02 13:49:56,722 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:56,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash 558350547, now seen corresponding path program 1 times [2018-12-02 13:49:56,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:56,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:56,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:56,772 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-02 13:49:56,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:56,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:49:56,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:49:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:49:56,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:49:56,773 INFO L87 Difference]: Start difference. First operand 7614 states and 17342 transitions. Second operand 6 states. [2018-12-02 13:49:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:56,953 INFO L93 Difference]: Finished difference Result 9775 states and 22056 transitions. [2018-12-02 13:49:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:49:56,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 13:49:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:56,960 INFO L225 Difference]: With dead ends: 9775 [2018-12-02 13:49:56,960 INFO L226 Difference]: Without dead ends: 9667 [2018-12-02 13:49:56,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:49:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2018-12-02 13:49:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7441. [2018-12-02 13:49:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-12-02 13:49:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 16948 transitions. [2018-12-02 13:49:57,025 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 16948 transitions. Word has length 94 [2018-12-02 13:49:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:57,026 INFO L480 AbstractCegarLoop]: Abstraction has 7441 states and 16948 transitions. [2018-12-02 13:49:57,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:49:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 16948 transitions. [2018-12-02 13:49:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:57,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:57,030 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-02 13:49:57,031 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:57,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash -679626374, now seen corresponding path program 1 times [2018-12-02 13:49:57,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:57,113 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-02 13:49:57,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:57,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 13:49:57,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 13:49:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 13:49:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:49:57,113 INFO L87 Difference]: Start difference. First operand 7441 states and 16948 transitions. Second operand 9 states. [2018-12-02 13:49:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:57,481 INFO L93 Difference]: Finished difference Result 10480 states and 23807 transitions. [2018-12-02 13:49:57,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 13:49:57,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 13:49:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:57,490 INFO L225 Difference]: With dead ends: 10480 [2018-12-02 13:49:57,491 INFO L226 Difference]: Without dead ends: 10448 [2018-12-02 13:49:57,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 13:49:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2018-12-02 13:49:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 9009. [2018-12-02 13:49:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-02 13:49:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 20408 transitions. [2018-12-02 13:49:57,576 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 20408 transitions. Word has length 94 [2018-12-02 13:49:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:57,576 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 20408 transitions. [2018-12-02 13:49:57,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 13:49:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 20408 transitions. [2018-12-02 13:49:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:57,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:57,582 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-02 13:49:57,582 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:57,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1818389563, now seen corresponding path program 1 times [2018-12-02 13:49:57,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:57,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:57,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:57,656 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-02 13:49:57,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:57,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 13:49:57,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 13:49:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:49:57,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:49:57,657 INFO L87 Difference]: Start difference. First operand 9009 states and 20408 transitions. Second operand 8 states. [2018-12-02 13:49:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:57,938 INFO L93 Difference]: Finished difference Result 14006 states and 32226 transitions. [2018-12-02 13:49:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 13:49:57,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 13:49:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:57,948 INFO L225 Difference]: With dead ends: 14006 [2018-12-02 13:49:57,948 INFO L226 Difference]: Without dead ends: 14006 [2018-12-02 13:49:57,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 13:49:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2018-12-02 13:49:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 9587. [2018-12-02 13:49:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9587 states. [2018-12-02 13:49:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 21909 transitions. [2018-12-02 13:49:58,040 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 21909 transitions. Word has length 94 [2018-12-02 13:49:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:58,040 INFO L480 AbstractCegarLoop]: Abstraction has 9587 states and 21909 transitions. [2018-12-02 13:49:58,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 13:49:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 21909 transitions. [2018-12-02 13:49:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:58,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:58,046 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-02 13:49:58,046 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:58,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1589074052, now seen corresponding path program 1 times [2018-12-02 13:49:58,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:58,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:58,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:58,120 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-02 13:49:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:49:58,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:49:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:49:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:49:58,121 INFO L87 Difference]: Start difference. First operand 9587 states and 21909 transitions. Second operand 7 states. [2018-12-02 13:49:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:58,239 INFO L93 Difference]: Finished difference Result 13549 states and 31264 transitions. [2018-12-02 13:49:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:58,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 13:49:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:58,254 INFO L225 Difference]: With dead ends: 13549 [2018-12-02 13:49:58,255 INFO L226 Difference]: Without dead ends: 13549 [2018-12-02 13:49:58,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:49:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13549 states. [2018-12-02 13:49:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13549 to 9658. [2018-12-02 13:49:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9658 states. [2018-12-02 13:49:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9658 states to 9658 states and 21873 transitions. [2018-12-02 13:49:58,350 INFO L78 Accepts]: Start accepts. Automaton has 9658 states and 21873 transitions. Word has length 94 [2018-12-02 13:49:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:58,350 INFO L480 AbstractCegarLoop]: Abstraction has 9658 states and 21873 transitions. [2018-12-02 13:49:58,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:49:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9658 states and 21873 transitions. [2018-12-02 13:49:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 13:49:58,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:58,356 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-02 13:49:58,356 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:58,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash 973917692, now seen corresponding path program 1 times [2018-12-02 13:49:58,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:58,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:58,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:58,434 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-02 13:49:58,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:58,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:49:58,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:49:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:49:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:49:58,434 INFO L87 Difference]: Start difference. First operand 9658 states and 21873 transitions. Second operand 6 states. [2018-12-02 13:49:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:58,508 INFO L93 Difference]: Finished difference Result 9178 states and 20417 transitions. [2018-12-02 13:49:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:49:58,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 13:49:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:58,514 INFO L225 Difference]: With dead ends: 9178 [2018-12-02 13:49:58,514 INFO L226 Difference]: Without dead ends: 9178 [2018-12-02 13:49:58,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:49:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2018-12-02 13:49:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 5738. [2018-12-02 13:49:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5738 states. [2018-12-02 13:49:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 12776 transitions. [2018-12-02 13:49:58,571 INFO L78 Accepts]: Start accepts. Automaton has 5738 states and 12776 transitions. Word has length 94 [2018-12-02 13:49:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:58,571 INFO L480 AbstractCegarLoop]: Abstraction has 5738 states and 12776 transitions. [2018-12-02 13:49:58,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:49:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5738 states and 12776 transitions. [2018-12-02 13:49:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:49:58,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:58,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:49:58,575 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:58,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash -641852995, now seen corresponding path program 1 times [2018-12-02 13:49:58,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:58,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:58,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:58,683 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-02 13:49:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:58,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 13:49:58,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 13:49:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 13:49:58,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:49:58,684 INFO L87 Difference]: Start difference. First operand 5738 states and 12776 transitions. Second operand 9 states. [2018-12-02 13:49:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:49:58,969 INFO L93 Difference]: Finished difference Result 6957 states and 15368 transitions. [2018-12-02 13:49:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 13:49:58,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 13:49:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:49:58,974 INFO L225 Difference]: With dead ends: 6957 [2018-12-02 13:49:58,975 INFO L226 Difference]: Without dead ends: 6957 [2018-12-02 13:49:58,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 13:49:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2018-12-02 13:49:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6701. [2018-12-02 13:49:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6701 states. [2018-12-02 13:49:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 14864 transitions. [2018-12-02 13:49:59,025 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 14864 transitions. Word has length 96 [2018-12-02 13:49:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:49:59,025 INFO L480 AbstractCegarLoop]: Abstraction has 6701 states and 14864 transitions. [2018-12-02 13:49:59,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 13:49:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 14864 transitions. [2018-12-02 13:49:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:49:59,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:49:59,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:49:59,029 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:49:59,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:49:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 245650686, now seen corresponding path program 1 times [2018-12-02 13:49:59,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:49:59,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:49:59,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:59,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:49:59,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:49:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:49:59,122 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-02 13:49:59,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:49:59,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 13:49:59,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 13:49:59,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 13:49:59,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 13:49:59,123 INFO L87 Difference]: Start difference. First operand 6701 states and 14864 transitions. Second operand 11 states. [2018-12-02 13:50:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:00,276 INFO L93 Difference]: Finished difference Result 12830 states and 28596 transitions. [2018-12-02 13:50:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 13:50:00,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 13:50:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:00,286 INFO L225 Difference]: With dead ends: 12830 [2018-12-02 13:50:00,286 INFO L226 Difference]: Without dead ends: 8745 [2018-12-02 13:50:00,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 13:50:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8745 states. [2018-12-02 13:50:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8745 to 6542. [2018-12-02 13:50:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2018-12-02 13:50:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 14471 transitions. [2018-12-02 13:50:00,347 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 14471 transitions. Word has length 96 [2018-12-02 13:50:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:00,347 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 14471 transitions. [2018-12-02 13:50:00,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 13:50:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 14471 transitions. [2018-12-02 13:50:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:50:00,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:00,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:00,351 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:00,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 748940697, now seen corresponding path program 1 times [2018-12-02 13:50:00,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:00,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:00,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:00,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:00,422 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-02 13:50:00,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:50:00,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:50:00,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:50:00,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:50:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:50:00,423 INFO L87 Difference]: Start difference. First operand 6542 states and 14471 transitions. Second operand 6 states. [2018-12-02 13:50:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:00,578 INFO L93 Difference]: Finished difference Result 5871 states and 12832 transitions. [2018-12-02 13:50:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:50:00,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 13:50:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:00,582 INFO L225 Difference]: With dead ends: 5871 [2018-12-02 13:50:00,582 INFO L226 Difference]: Without dead ends: 5871 [2018-12-02 13:50:00,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:50:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2018-12-02 13:50:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5487. [2018-12-02 13:50:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2018-12-02 13:50:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 12022 transitions. [2018-12-02 13:50:00,620 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 12022 transitions. Word has length 96 [2018-12-02 13:50:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:00,620 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 12022 transitions. [2018-12-02 13:50:00,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:50:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 12022 transitions. [2018-12-02 13:50:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:50:00,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:00,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:00,624 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:00,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1855465141, now seen corresponding path program 2 times [2018-12-02 13:50:00,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:00,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:00,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:00,685 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-02 13:50:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:50:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:50:00,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 13:50:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:50:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:50:00,686 INFO L87 Difference]: Start difference. First operand 5487 states and 12022 transitions. Second operand 7 states. [2018-12-02 13:50:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:00,884 INFO L93 Difference]: Finished difference Result 6240 states and 13688 transitions. [2018-12-02 13:50:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:50:00,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 13:50:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:00,889 INFO L225 Difference]: With dead ends: 6240 [2018-12-02 13:50:00,889 INFO L226 Difference]: Without dead ends: 6240 [2018-12-02 13:50:00,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:50:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6240 states. [2018-12-02 13:50:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6240 to 5652. [2018-12-02 13:50:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2018-12-02 13:50:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 12377 transitions. [2018-12-02 13:50:00,928 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 12377 transitions. Word has length 96 [2018-12-02 13:50:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:00,929 INFO L480 AbstractCegarLoop]: Abstraction has 5652 states and 12377 transitions. [2018-12-02 13:50:00,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 13:50:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 12377 transitions. [2018-12-02 13:50:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:50:00,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:00,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:00,947 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:00,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash 504375307, now seen corresponding path program 1 times [2018-12-02 13:50:00,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:00,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:01,007 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-02 13:50:01,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:50:01,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 13:50:01,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 13:50:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:50:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:50:01,008 INFO L87 Difference]: Start difference. First operand 5652 states and 12377 transitions. Second operand 8 states. [2018-12-02 13:50:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:01,352 INFO L93 Difference]: Finished difference Result 8717 states and 19079 transitions. [2018-12-02 13:50:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 13:50:01,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 13:50:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:01,358 INFO L225 Difference]: With dead ends: 8717 [2018-12-02 13:50:01,358 INFO L226 Difference]: Without dead ends: 8677 [2018-12-02 13:50:01,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-02 13:50:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2018-12-02 13:50:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6180. [2018-12-02 13:50:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6180 states. [2018-12-02 13:50:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 13475 transitions. [2018-12-02 13:50:01,409 INFO L78 Accepts]: Start accepts. Automaton has 6180 states and 13475 transitions. Word has length 96 [2018-12-02 13:50:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:01,409 INFO L480 AbstractCegarLoop]: Abstraction has 6180 states and 13475 transitions. [2018-12-02 13:50:01,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 13:50:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6180 states and 13475 transitions. [2018-12-02 13:50:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:50:01,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:01,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:01,414 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:01,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1465989324, now seen corresponding path program 2 times [2018-12-02 13:50:01,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:01,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:01,451 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 13:50:01,520 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 13:50:01,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:50:01 BasicIcfg [2018-12-02 13:50:01,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:50:01,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:50:01,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:50:01,522 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:50:01,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:49:44" (3/4) ... [2018-12-02 13:50:01,524 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 13:50:01,598 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9697e920-9f5d-4380-9b94-cf456a60ac42/bin-2019/uautomizer/witness.graphml [2018-12-02 13:50:01,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:50:01,599 INFO L168 Benchmark]: Toolchain (without parser) took 18225.50 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 950.6 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 467.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:01,600 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:01,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:01,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.40 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:01,601 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 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-02 13:50:01,601 INFO L168 Benchmark]: RCFGBuilder took 349.35 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: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:01,601 INFO L168 Benchmark]: TraceAbstraction took 17418.44 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 407.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:01,601 INFO L168 Benchmark]: Witness Printer took 76.97 ms. Allocated memory is still 2.8 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:01,603 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.40 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.83 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 349.35 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: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17418.44 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 407.8 MB. Max. memory is 11.5 GB. * Witness Printer took 76.97 ms. Allocated memory is still 2.8 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t1607; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1608; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -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) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -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 [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -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 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 17.3s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8984 SDtfs, 9732 SDslu, 20401 SDs, 0 SdLazy, 8771 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 88 SyntacticMatches, 29 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35692occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 84914 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2654 NumberOfCodeBlocks, 2654 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2524 ConstructedInterpolants, 0 QuantifiedInterpolants, 611335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...