./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_pso.opt_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_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/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 46d15676297641b1bbddbc888fde8bc988df789f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:52:06,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:52:06,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:52:06,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:52:06,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:52:06,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:52:06,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:52:06,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:52:06,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:52:06,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:52:06,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:52:06,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:52:06,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:52:06,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:52:06,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:52:06,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:52:06,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:52:06,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:52:06,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:52:06,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:52:06,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:52:06,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:52:06,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:52:06,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:52:06,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:52:06,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:52:06,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:52:06,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:52:06,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:52:06,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:52:06,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:52:06,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:52:06,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:52:06,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:52:06,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:52:06,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:52:06,802 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 10:52:06,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:52:06,809 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:52:06,810 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 10:52:06,810 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 10:52:06,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:52:06,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:52:06,810 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:52:06,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:52:06,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 10:52:06,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 10:52:06,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 10:52:06,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 10:52:06,812 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_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/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 -> 46d15676297641b1bbddbc888fde8bc988df789f [2018-12-08 10:52:06,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:52:06,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:52:06,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:52:06,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:52:06,843 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:52:06,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi010_pso.opt_false-unreach-call.i [2018-12-08 10:52:06,889 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/data/8025a8a14/6d0bd05499d64436974dc42bf9f55b1e/FLAGac42ba6e2 [2018-12-08 10:52:07,314 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:52:07,314 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/sv-benchmarks/c/pthread-wmm/rfi010_pso.opt_false-unreach-call.i [2018-12-08 10:52:07,320 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/data/8025a8a14/6d0bd05499d64436974dc42bf9f55b1e/FLAGac42ba6e2 [2018-12-08 10:52:07,329 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/data/8025a8a14/6d0bd05499d64436974dc42bf9f55b1e [2018-12-08 10:52:07,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:52:07,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:52:07,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:52:07,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:52:07,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:52:07,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,336 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 08.12 10:52:07, skipping insertion in model container [2018-12-08 10:52:07,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:52:07,361 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:52:07,548 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:52:07,555 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:52:07,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:52:07,679 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:52:07,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07 WrapperNode [2018-12-08 10:52:07,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:52:07,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:52:07,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:52:07,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:52:07,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:52:07,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:52:07,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:52:07,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:52:07,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... [2018-12-08 10:52:07,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:52:07,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:52:07,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:52:07,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:52:07,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/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-08 10:52:07,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:52:07,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:52:07,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 10:52:07,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:52:07,767 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 10:52:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 10:52:07,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 10:52:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 10:52:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 10:52:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:52:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:52:07,769 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 10:52:08,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:52:08,123 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 10:52:08,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:52:08 BoogieIcfgContainer [2018-12-08 10:52:08,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:52:08,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 10:52:08,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 10:52:08,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 10:52:08,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:52:07" (1/3) ... [2018-12-08 10:52:08,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7787739e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:52:08, skipping insertion in model container [2018-12-08 10:52:08,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:52:07" (2/3) ... [2018-12-08 10:52:08,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7787739e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:52:08, skipping insertion in model container [2018-12-08 10:52:08,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:52:08" (3/3) ... [2018-12-08 10:52:08,128 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_pso.opt_false-unreach-call.i [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,154 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,155 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,160 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,161 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:52:08,179 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 10:52:08,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 10:52:08,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 10:52:08,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 10:52:08,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:52:08,209 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 10:52:08,209 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 10:52:08,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 10:52:08,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:52:08,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:52:08,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 10:52:08,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:52:08,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 10:52:08,216 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-08 10:52:13,794 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-08 10:52:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-08 10:52:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 10:52:13,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:13,803 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] [2018-12-08 10:52:13,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:13,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-08 10:52:13,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:13,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:13,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:13,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:13,972 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-08 10:52:13,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:13,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:52:13,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:52:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:52:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:52:13,986 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-08 10:52:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:14,795 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-08 10:52:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:52:14,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-08 10:52:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:15,150 INFO L225 Difference]: With dead ends: 150583 [2018-12-08 10:52:15,150 INFO L226 Difference]: Without dead ends: 105839 [2018-12-08 10:52:15,151 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-08 10:52:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-08 10:52:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-08 10:52:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-08 10:52:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-08 10:52:17,399 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-08 10:52:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:17,399 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-08 10:52:17,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:52:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-08 10:52:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 10:52:17,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:17,404 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-08 10:52:17,404 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:17,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-08 10:52:17,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:17,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:17,456 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-08 10:52:17,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:17,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:52:17,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:52:17,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:52:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:52:17,458 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-08 10:52:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:19,546 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-08 10:52:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:52:19,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 10:52:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:19,882 INFO L225 Difference]: With dead ends: 146039 [2018-12-08 10:52:19,882 INFO L226 Difference]: Without dead ends: 145471 [2018-12-08 10:52:19,882 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-08 10:52:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-08 10:52:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-08 10:52:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-08 10:52:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-08 10:52:22,317 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-08 10:52:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:22,318 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-08 10:52:22,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:52:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-08 10:52:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 10:52:22,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:22,321 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-08 10:52:22,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:22,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 136646938, now seen corresponding path program 1 times [2018-12-08 10:52:22,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:22,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:22,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:22,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:22,363 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-08 10:52:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:22,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:52:22,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:52:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:52:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:52:22,364 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-08 10:52:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:23,529 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-08 10:52:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:52:23,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 10:52:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:23,942 INFO L225 Difference]: With dead ends: 199269 [2018-12-08 10:52:23,942 INFO L226 Difference]: Without dead ends: 198805 [2018-12-08 10:52:23,942 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-08 10:52:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-08 10:52:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-08 10:52:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-08 10:52:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-08 10:52:27,128 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-08 10:52:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:27,129 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-08 10:52:27,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:52:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-08 10:52:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 10:52:27,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:27,135 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-08 10:52:27,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:27,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash -943699264, now seen corresponding path program 1 times [2018-12-08 10:52:27,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:27,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:27,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:27,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:27,158 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-08 10:52:27,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:27,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:52:27,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:52:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:52:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:52:27,159 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-08 10:52:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:28,031 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-08 10:52:28,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:52:28,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-08 10:52:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:28,373 INFO L225 Difference]: With dead ends: 179115 [2018-12-08 10:52:28,373 INFO L226 Difference]: Without dead ends: 179115 [2018-12-08 10:52:28,374 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-08 10:52:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-08 10:52:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-08 10:52:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-08 10:52:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-08 10:52:33,164 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-08 10:52:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:33,164 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-08 10:52:33,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:52:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-08 10:52:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 10:52:33,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:33,179 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-08 10:52:33,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:33,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:33,180 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-08 10:52:33,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:33,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:33,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:33,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:33,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:33,263 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-08 10:52:33,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:33,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:33,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:33,264 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-08 10:52:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:34,406 INFO L93 Difference]: Finished difference Result 214598 states and 788311 transitions. [2018-12-08 10:52:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:52:34,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 10:52:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:34,871 INFO L225 Difference]: With dead ends: 214598 [2018-12-08 10:52:34,871 INFO L226 Difference]: Without dead ends: 214598 [2018-12-08 10:52:34,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:52:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214598 states. [2018-12-08 10:52:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214598 to 200128. [2018-12-08 10:52:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200128 states. [2018-12-08 10:52:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200128 states to 200128 states and 735197 transitions. [2018-12-08 10:52:41,804 INFO L78 Accepts]: Start accepts. Automaton has 200128 states and 735197 transitions. Word has length 53 [2018-12-08 10:52:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:41,805 INFO L480 AbstractCegarLoop]: Abstraction has 200128 states and 735197 transitions. [2018-12-08 10:52:41,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 200128 states and 735197 transitions. [2018-12-08 10:52:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 10:52:41,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:41,822 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-08 10:52:41,822 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:41,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-08 10:52:41,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:41,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:41,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:41,892 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-08 10:52:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:41,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:52:41,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:52:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:52:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:52:41,893 INFO L87 Difference]: Start difference. First operand 200128 states and 735197 transitions. Second operand 7 states. [2018-12-08 10:52:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:43,548 INFO L93 Difference]: Finished difference Result 283834 states and 1009167 transitions. [2018-12-08 10:52:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 10:52:43,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-08 10:52:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:44,131 INFO L225 Difference]: With dead ends: 283834 [2018-12-08 10:52:44,132 INFO L226 Difference]: Without dead ends: 283834 [2018-12-08 10:52:44,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 10:52:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283834 states. [2018-12-08 10:52:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283834 to 228356. [2018-12-08 10:52:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228356 states. [2018-12-08 10:52:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228356 states to 228356 states and 826700 transitions. [2018-12-08 10:52:49,716 INFO L78 Accepts]: Start accepts. Automaton has 228356 states and 826700 transitions. Word has length 53 [2018-12-08 10:52:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:49,716 INFO L480 AbstractCegarLoop]: Abstraction has 228356 states and 826700 transitions. [2018-12-08 10:52:49,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:52:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 228356 states and 826700 transitions. [2018-12-08 10:52:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 10:52:49,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:49,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, 1, 1, 1, 1] [2018-12-08 10:52:49,732 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:49,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-08 10:52:49,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:49,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:49,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:49,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:49,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-08 10:52:49,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:49,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:52:49,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:52:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:52:49,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:52:49,758 INFO L87 Difference]: Start difference. First operand 228356 states and 826700 transitions. Second operand 4 states. [2018-12-08 10:52:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:49,859 INFO L93 Difference]: Finished difference Result 38827 states and 123113 transitions. [2018-12-08 10:52:49,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:52:49,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-08 10:52:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:49,901 INFO L225 Difference]: With dead ends: 38827 [2018-12-08 10:52:49,901 INFO L226 Difference]: Without dead ends: 32376 [2018-12-08 10:52:49,902 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-08 10:52:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32376 states. [2018-12-08 10:52:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32376 to 32135. [2018-12-08 10:52:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32135 states. [2018-12-08 10:52:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32135 states to 32135 states and 100387 transitions. [2018-12-08 10:52:50,241 INFO L78 Accepts]: Start accepts. Automaton has 32135 states and 100387 transitions. Word has length 53 [2018-12-08 10:52:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:50,242 INFO L480 AbstractCegarLoop]: Abstraction has 32135 states and 100387 transitions. [2018-12-08 10:52:50,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:52:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 32135 states and 100387 transitions. [2018-12-08 10:52:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 10:52:50,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:50,244 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-08 10:52:50,244 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:50,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1658594805, now seen corresponding path program 1 times [2018-12-08 10:52:50,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:50,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:50,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:50,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:50,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:50,280 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-08 10:52:50,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:50,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:50,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:50,281 INFO L87 Difference]: Start difference. First operand 32135 states and 100387 transitions. Second operand 6 states. [2018-12-08 10:52:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:50,679 INFO L93 Difference]: Finished difference Result 42537 states and 131570 transitions. [2018-12-08 10:52:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:52:50,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 10:52:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:50,730 INFO L225 Difference]: With dead ends: 42537 [2018-12-08 10:52:50,730 INFO L226 Difference]: Without dead ends: 42440 [2018-12-08 10:52:50,730 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-08 10:52:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42440 states. [2018-12-08 10:52:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42440 to 31836. [2018-12-08 10:52:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2018-12-08 10:52:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 99515 transitions. [2018-12-08 10:52:51,123 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 99515 transitions. Word has length 53 [2018-12-08 10:52:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:51,124 INFO L480 AbstractCegarLoop]: Abstraction has 31836 states and 99515 transitions. [2018-12-08 10:52:51,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 99515 transitions. [2018-12-08 10:52:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:52:51,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:51,128 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] [2018-12-08 10:52:51,128 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:51,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:51,128 INFO L82 PathProgramCache]: Analyzing trace with hash 228917533, now seen corresponding path program 1 times [2018-12-08 10:52:51,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:51,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:51,164 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-08 10:52:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:52:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:52:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:52:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:52:51,165 INFO L87 Difference]: Start difference. First operand 31836 states and 99515 transitions. Second operand 4 states. [2018-12-08 10:52:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:51,366 INFO L93 Difference]: Finished difference Result 41208 states and 129949 transitions. [2018-12-08 10:52:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:52:51,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 10:52:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:51,418 INFO L225 Difference]: With dead ends: 41208 [2018-12-08 10:52:51,418 INFO L226 Difference]: Without dead ends: 41208 [2018-12-08 10:52:51,418 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-08 10:52:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41208 states. [2018-12-08 10:52:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41208 to 35932. [2018-12-08 10:52:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35932 states. [2018-12-08 10:52:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35932 states to 35932 states and 112644 transitions. [2018-12-08 10:52:51,837 INFO L78 Accepts]: Start accepts. Automaton has 35932 states and 112644 transitions. Word has length 63 [2018-12-08 10:52:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:51,837 INFO L480 AbstractCegarLoop]: Abstraction has 35932 states and 112644 transitions. [2018-12-08 10:52:51,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:52:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 35932 states and 112644 transitions. [2018-12-08 10:52:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:52:51,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:51,843 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] [2018-12-08 10:52:51,843 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:51,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1971727868, now seen corresponding path program 1 times [2018-12-08 10:52:51,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:51,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:51,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:51,881 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-08 10:52:51,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:51,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:51,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:51,882 INFO L87 Difference]: Start difference. First operand 35932 states and 112644 transitions. Second operand 6 states. [2018-12-08 10:52:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:52,418 INFO L93 Difference]: Finished difference Result 72509 states and 225560 transitions. [2018-12-08 10:52:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:52:52,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-08 10:52:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:52,517 INFO L225 Difference]: With dead ends: 72509 [2018-12-08 10:52:52,517 INFO L226 Difference]: Without dead ends: 72445 [2018-12-08 10:52:52,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 10:52:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72445 states. [2018-12-08 10:52:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72445 to 40892. [2018-12-08 10:52:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40892 states. [2018-12-08 10:52:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40892 states to 40892 states and 126622 transitions. [2018-12-08 10:52:53,267 INFO L78 Accepts]: Start accepts. Automaton has 40892 states and 126622 transitions. Word has length 63 [2018-12-08 10:52:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:53,267 INFO L480 AbstractCegarLoop]: Abstraction has 40892 states and 126622 transitions. [2018-12-08 10:52:53,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40892 states and 126622 transitions. [2018-12-08 10:52:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:52:53,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:53,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:53,277 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:53,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash -203492115, now seen corresponding path program 1 times [2018-12-08 10:52:53,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:53,295 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-08 10:52:53,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:53,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:52:53,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:52:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:52:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:52:53,295 INFO L87 Difference]: Start difference. First operand 40892 states and 126622 transitions. Second operand 3 states. [2018-12-08 10:52:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:53,415 INFO L93 Difference]: Finished difference Result 46897 states and 143099 transitions. [2018-12-08 10:52:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:52:53,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 10:52:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:53,470 INFO L225 Difference]: With dead ends: 46897 [2018-12-08 10:52:53,470 INFO L226 Difference]: Without dead ends: 46897 [2018-12-08 10:52:53,470 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-08 10:52:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2018-12-08 10:52:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 40580. [2018-12-08 10:52:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40580 states. [2018-12-08 10:52:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 123024 transitions. [2018-12-08 10:52:53,928 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 123024 transitions. Word has length 69 [2018-12-08 10:52:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:53,928 INFO L480 AbstractCegarLoop]: Abstraction has 40580 states and 123024 transitions. [2018-12-08 10:52:53,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:52:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 123024 transitions. [2018-12-08 10:52:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 10:52:53,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:53,939 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] [2018-12-08 10:52:53,939 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:53,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash 756655101, now seen corresponding path program 1 times [2018-12-08 10:52:53,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:53,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:53,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:54,025 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-08 10:52:54,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:54,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:52:54,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:52:54,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:52:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:52:54,026 INFO L87 Difference]: Start difference. First operand 40580 states and 123024 transitions. Second operand 7 states. [2018-12-08 10:52:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:54,793 INFO L93 Difference]: Finished difference Result 56545 states and 170864 transitions. [2018-12-08 10:52:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:52:54,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-08 10:52:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:54,863 INFO L225 Difference]: With dead ends: 56545 [2018-12-08 10:52:54,863 INFO L226 Difference]: Without dead ends: 56241 [2018-12-08 10:52:54,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:52:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56241 states. [2018-12-08 10:52:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56241 to 47672. [2018-12-08 10:52:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2018-12-08 10:52:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2018-12-08 10:52:55,437 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2018-12-08 10:52:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:55,437 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2018-12-08 10:52:55,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:52:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2018-12-08 10:52:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 10:52:55,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:55,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:55,453 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:55,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1040296258, now seen corresponding path program 1 times [2018-12-08 10:52:55,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:55,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:55,518 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-08 10:52:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:55,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:52:55,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:52:55,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:52:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:52:55,519 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2018-12-08 10:52:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:56,310 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2018-12-08 10:52:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:52:56,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-12-08 10:52:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:56,379 INFO L225 Difference]: With dead ends: 57838 [2018-12-08 10:52:56,379 INFO L226 Difference]: Without dead ends: 57838 [2018-12-08 10:52:56,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:52:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2018-12-08 10:52:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2018-12-08 10:52:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2018-12-08 10:52:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2018-12-08 10:52:56,991 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2018-12-08 10:52:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:56,991 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2018-12-08 10:52:56,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:52:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2018-12-08 10:52:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 10:52:57,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:57,004 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] [2018-12-08 10:52:57,004 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:57,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -152792577, now seen corresponding path program 1 times [2018-12-08 10:52:57,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:57,031 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-08 10:52:57,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:57,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:52:57,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:52:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:52:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:52:57,032 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2018-12-08 10:52:57,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:57,083 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2018-12-08 10:52:57,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:52:57,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 10:52:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:57,092 INFO L225 Difference]: With dead ends: 13236 [2018-12-08 10:52:57,092 INFO L226 Difference]: Without dead ends: 11116 [2018-12-08 10:52:57,092 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-08 10:52:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2018-12-08 10:52:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2018-12-08 10:52:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-12-08 10:52:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2018-12-08 10:52:57,171 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2018-12-08 10:52:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:57,172 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2018-12-08 10:52:57,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:52:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2018-12-08 10:52:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:52:57,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:57,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:57,178 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:57,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1361713172, now seen corresponding path program 1 times [2018-12-08 10:52:57,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:57,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:57,218 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-08 10:52:57,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:57,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:52:57,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:52:57,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:52:57,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:52:57,219 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2018-12-08 10:52:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:57,356 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2018-12-08 10:52:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:52:57,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-08 10:52:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:57,364 INFO L225 Difference]: With dead ends: 9960 [2018-12-08 10:52:57,364 INFO L226 Difference]: Without dead ends: 9960 [2018-12-08 10:52:57,364 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-08 10:52:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2018-12-08 10:52:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2018-12-08 10:52:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-08 10:52:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2018-12-08 10:52:57,437 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2018-12-08 10:52:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:57,437 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2018-12-08 10:52:57,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:52:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2018-12-08 10:52:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:52:57,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:57,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:57,444 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:57,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash 856044781, now seen corresponding path program 1 times [2018-12-08 10:52:57,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:57,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:57,471 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-08 10:52:57,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:57,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:52:57,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:52:57,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:52:57,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:52:57,472 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 3 states. [2018-12-08 10:52:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:57,611 INFO L93 Difference]: Finished difference Result 12725 states and 30850 transitions. [2018-12-08 10:52:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:52:57,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-08 10:52:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:57,620 INFO L225 Difference]: With dead ends: 12725 [2018-12-08 10:52:57,620 INFO L226 Difference]: Without dead ends: 12725 [2018-12-08 10:52:57,620 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-08 10:52:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12725 states. [2018-12-08 10:52:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12725 to 11524. [2018-12-08 10:52:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11524 states. [2018-12-08 10:52:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11524 states to 11524 states and 28181 transitions. [2018-12-08 10:52:57,716 INFO L78 Accepts]: Start accepts. Automaton has 11524 states and 28181 transitions. Word has length 98 [2018-12-08 10:52:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:57,716 INFO L480 AbstractCegarLoop]: Abstraction has 11524 states and 28181 transitions. [2018-12-08 10:52:57,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:52:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11524 states and 28181 transitions. [2018-12-08 10:52:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:52:57,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:57,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:52:57,724 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:57,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1908326467, now seen corresponding path program 2 times [2018-12-08 10:52:57,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:57,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:57,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:57,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:57,778 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-08 10:52:57,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:57,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:57,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:57,779 INFO L87 Difference]: Start difference. First operand 11524 states and 28181 transitions. Second operand 6 states. [2018-12-08 10:52:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:58,090 INFO L93 Difference]: Finished difference Result 14264 states and 34204 transitions. [2018-12-08 10:52:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:52:58,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-08 10:52:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:58,099 INFO L225 Difference]: With dead ends: 14264 [2018-12-08 10:52:58,099 INFO L226 Difference]: Without dead ends: 14264 [2018-12-08 10:52:58,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:52:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2018-12-08 10:52:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 11317. [2018-12-08 10:52:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-12-08 10:52:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 27219 transitions. [2018-12-08 10:52:58,199 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 27219 transitions. Word has length 98 [2018-12-08 10:52:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:58,199 INFO L480 AbstractCegarLoop]: Abstraction has 11317 states and 27219 transitions. [2018-12-08 10:52:58,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 27219 transitions. [2018-12-08 10:52:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 10:52:58,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:58,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:58,207 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:58,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1659083001, now seen corresponding path program 1 times [2018-12-08 10:52:58,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:58,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:52:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:58,271 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-08 10:52:58,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:58,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:58,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:58,272 INFO L87 Difference]: Start difference. First operand 11317 states and 27219 transitions. Second operand 6 states. [2018-12-08 10:52:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:58,490 INFO L93 Difference]: Finished difference Result 13695 states and 32744 transitions. [2018-12-08 10:52:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:52:58,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 10:52:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:58,499 INFO L225 Difference]: With dead ends: 13695 [2018-12-08 10:52:58,499 INFO L226 Difference]: Without dead ends: 13663 [2018-12-08 10:52:58,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:52:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2018-12-08 10:52:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 12238. [2018-12-08 10:52:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12238 states. [2018-12-08 10:52:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12238 states to 12238 states and 29366 transitions. [2018-12-08 10:52:58,600 INFO L78 Accepts]: Start accepts. Automaton has 12238 states and 29366 transitions. Word has length 100 [2018-12-08 10:52:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:58,600 INFO L480 AbstractCegarLoop]: Abstraction has 12238 states and 29366 transitions. [2018-12-08 10:52:58,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12238 states and 29366 transitions. [2018-12-08 10:52:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 10:52:58,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:58,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:58,609 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:58,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash -137868358, now seen corresponding path program 1 times [2018-12-08 10:52:58,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:58,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:58,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:58,666 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-08 10:52:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:58,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:52:58,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:52:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:52:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:52:58,667 INFO L87 Difference]: Start difference. First operand 12238 states and 29366 transitions. Second operand 7 states. [2018-12-08 10:52:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:59,060 INFO L93 Difference]: Finished difference Result 18053 states and 43645 transitions. [2018-12-08 10:52:59,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:52:59,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-08 10:52:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:59,072 INFO L225 Difference]: With dead ends: 18053 [2018-12-08 10:52:59,073 INFO L226 Difference]: Without dead ends: 18053 [2018-12-08 10:52:59,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:52:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2018-12-08 10:52:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 12767. [2018-12-08 10:52:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2018-12-08 10:52:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 30777 transitions. [2018-12-08 10:52:59,199 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 30777 transitions. Word has length 100 [2018-12-08 10:52:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:59,199 INFO L480 AbstractCegarLoop]: Abstraction has 12767 states and 30777 transitions. [2018-12-08 10:52:59,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:52:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 30777 transitions. [2018-12-08 10:52:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 10:52:59,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:59,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:59,209 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:59,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash 749635323, now seen corresponding path program 1 times [2018-12-08 10:52:59,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:59,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:59,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:59,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:59,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:59,256 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-08 10:52:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:59,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:59,257 INFO L87 Difference]: Start difference. First operand 12767 states and 30777 transitions. Second operand 6 states. [2018-12-08 10:52:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:59,443 INFO L93 Difference]: Finished difference Result 15015 states and 35894 transitions. [2018-12-08 10:52:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:52:59,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 10:52:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:59,454 INFO L225 Difference]: With dead ends: 15015 [2018-12-08 10:52:59,454 INFO L226 Difference]: Without dead ends: 15015 [2018-12-08 10:52:59,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2018-12-08 10:52:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 13041. [2018-12-08 10:52:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13041 states. [2018-12-08 10:52:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13041 states to 13041 states and 31436 transitions. [2018-12-08 10:52:59,568 INFO L78 Accepts]: Start accepts. Automaton has 13041 states and 31436 transitions. Word has length 100 [2018-12-08 10:52:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:59,568 INFO L480 AbstractCegarLoop]: Abstraction has 13041 states and 31436 transitions. [2018-12-08 10:52:59,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13041 states and 31436 transitions. [2018-12-08 10:52:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 10:52:59,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:59,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:59,577 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:59,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2119042649, now seen corresponding path program 1 times [2018-12-08 10:52:59,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:59,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:59,637 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-08 10:52:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:59,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:52:59,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:52:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:52:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:52:59,637 INFO L87 Difference]: Start difference. First operand 13041 states and 31436 transitions. Second operand 6 states. [2018-12-08 10:52:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:59,747 INFO L93 Difference]: Finished difference Result 12769 states and 30484 transitions. [2018-12-08 10:52:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:52:59,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 10:52:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:52:59,756 INFO L225 Difference]: With dead ends: 12769 [2018-12-08 10:52:59,756 INFO L226 Difference]: Without dead ends: 12769 [2018-12-08 10:52:59,756 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-08 10:52:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12769 states. [2018-12-08 10:52:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12769 to 10327. [2018-12-08 10:52:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10327 states. [2018-12-08 10:52:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 24777 transitions. [2018-12-08 10:52:59,845 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 24777 transitions. Word has length 100 [2018-12-08 10:52:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:52:59,845 INFO L480 AbstractCegarLoop]: Abstraction has 10327 states and 24777 transitions. [2018-12-08 10:52:59,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:52:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 24777 transitions. [2018-12-08 10:52:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 10:52:59,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:52:59,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:52:59,852 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:52:59,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash -22235627, now seen corresponding path program 1 times [2018-12-08 10:52:59,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:59,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:59,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:59,888 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-08 10:52:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:52:59,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:52:59,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:52:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:52:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:52:59,889 INFO L87 Difference]: Start difference. First operand 10327 states and 24777 transitions. Second operand 5 states. [2018-12-08 10:53:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:00,043 INFO L93 Difference]: Finished difference Result 12330 states and 29018 transitions. [2018-12-08 10:53:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:53:00,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 10:53:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:00,051 INFO L225 Difference]: With dead ends: 12330 [2018-12-08 10:53:00,051 INFO L226 Difference]: Without dead ends: 12330 [2018-12-08 10:53:00,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:53:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12330 states. [2018-12-08 10:53:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12330 to 10500. [2018-12-08 10:53:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2018-12-08 10:53:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 25146 transitions. [2018-12-08 10:53:00,135 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 25146 transitions. Word has length 100 [2018-12-08 10:53:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:00,136 INFO L480 AbstractCegarLoop]: Abstraction has 10500 states and 25146 transitions. [2018-12-08 10:53:00,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:53:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 25146 transitions. [2018-12-08 10:53:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:00,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:00,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:00,142 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:00,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash -909176834, now seen corresponding path program 1 times [2018-12-08 10:53:00,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:00,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:00,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:53:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:00,201 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-08 10:53:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:53:00,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:53:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:53:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:53:00,202 INFO L87 Difference]: Start difference. First operand 10500 states and 25146 transitions. Second operand 8 states. [2018-12-08 10:53:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:00,875 INFO L93 Difference]: Finished difference Result 18823 states and 44161 transitions. [2018-12-08 10:53:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 10:53:00,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-08 10:53:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:00,888 INFO L225 Difference]: With dead ends: 18823 [2018-12-08 10:53:00,888 INFO L226 Difference]: Without dead ends: 18728 [2018-12-08 10:53:00,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:53:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18728 states. [2018-12-08 10:53:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18728 to 13537. [2018-12-08 10:53:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13537 states. [2018-12-08 10:53:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13537 states to 13537 states and 32323 transitions. [2018-12-08 10:53:01,026 INFO L78 Accepts]: Start accepts. Automaton has 13537 states and 32323 transitions. Word has length 102 [2018-12-08 10:53:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:01,026 INFO L480 AbstractCegarLoop]: Abstraction has 13537 states and 32323 transitions. [2018-12-08 10:53:01,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:53:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13537 states and 32323 transitions. [2018-12-08 10:53:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:01,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:01,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:01,036 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:01,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1308581119, now seen corresponding path program 1 times [2018-12-08 10:53:01,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:01,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:53:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:01,114 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-08 10:53:01,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:01,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:53:01,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:53:01,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:53:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:53:01,115 INFO L87 Difference]: Start difference. First operand 13537 states and 32323 transitions. Second operand 7 states. [2018-12-08 10:53:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:01,435 INFO L93 Difference]: Finished difference Result 18636 states and 43263 transitions. [2018-12-08 10:53:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:53:01,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 10:53:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:01,447 INFO L225 Difference]: With dead ends: 18636 [2018-12-08 10:53:01,447 INFO L226 Difference]: Without dead ends: 18636 [2018-12-08 10:53:01,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:53:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18636 states. [2018-12-08 10:53:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18636 to 15989. [2018-12-08 10:53:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15989 states. [2018-12-08 10:53:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15989 states to 15989 states and 37604 transitions. [2018-12-08 10:53:01,597 INFO L78 Accepts]: Start accepts. Automaton has 15989 states and 37604 transitions. Word has length 102 [2018-12-08 10:53:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 15989 states and 37604 transitions. [2018-12-08 10:53:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:53:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15989 states and 37604 transitions. [2018-12-08 10:53:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:01,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:01,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:01,609 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:01,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1519932032, now seen corresponding path program 1 times [2018-12-08 10:53:01,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:53:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:01,708 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-08 10:53:01,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 10:53:01,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 10:53:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 10:53:01,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:53:01,709 INFO L87 Difference]: Start difference. First operand 15989 states and 37604 transitions. Second operand 11 states. [2018-12-08 10:53:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:02,267 INFO L93 Difference]: Finished difference Result 18309 states and 42698 transitions. [2018-12-08 10:53:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 10:53:02,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-12-08 10:53:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:02,279 INFO L225 Difference]: With dead ends: 18309 [2018-12-08 10:53:02,279 INFO L226 Difference]: Without dead ends: 18309 [2018-12-08 10:53:02,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-08 10:53:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18309 states. [2018-12-08 10:53:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18309 to 16306. [2018-12-08 10:53:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16306 states. [2018-12-08 10:53:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16306 states to 16306 states and 38339 transitions. [2018-12-08 10:53:02,419 INFO L78 Accepts]: Start accepts. Automaton has 16306 states and 38339 transitions. Word has length 102 [2018-12-08 10:53:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:02,419 INFO L480 AbstractCegarLoop]: Abstraction has 16306 states and 38339 transitions. [2018-12-08 10:53:02,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 10:53:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16306 states and 38339 transitions. [2018-12-08 10:53:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:02,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:02,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:02,430 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:02,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1887531583, now seen corresponding path program 1 times [2018-12-08 10:53:02,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:02,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:02,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:53:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:02,532 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-08 10:53:02,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:02,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 10:53:02,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 10:53:02,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 10:53:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:53:02,532 INFO L87 Difference]: Start difference. First operand 16306 states and 38339 transitions. Second operand 11 states. [2018-12-08 10:53:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:02,868 INFO L93 Difference]: Finished difference Result 30316 states and 71658 transitions. [2018-12-08 10:53:02,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 10:53:02,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-12-08 10:53:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:02,870 INFO L225 Difference]: With dead ends: 30316 [2018-12-08 10:53:02,871 INFO L226 Difference]: Without dead ends: 4010 [2018-12-08 10:53:02,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:53:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2018-12-08 10:53:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 4008. [2018-12-08 10:53:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2018-12-08 10:53:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 9530 transitions. [2018-12-08 10:53:02,896 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 9530 transitions. Word has length 102 [2018-12-08 10:53:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:02,896 INFO L480 AbstractCegarLoop]: Abstraction has 4008 states and 9530 transitions. [2018-12-08 10:53:02,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 10:53:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 9530 transitions. [2018-12-08 10:53:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:02,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:02,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:02,899 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:02,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1426663114, now seen corresponding path program 1 times [2018-12-08 10:53:02,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:02,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:02,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:53:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:02,940 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-08 10:53:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:53:02,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:53:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:53:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:53:02,941 INFO L87 Difference]: Start difference. First operand 4008 states and 9530 transitions. Second operand 5 states. [2018-12-08 10:53:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:03,051 INFO L93 Difference]: Finished difference Result 4477 states and 10543 transitions. [2018-12-08 10:53:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:53:03,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-08 10:53:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:03,054 INFO L225 Difference]: With dead ends: 4477 [2018-12-08 10:53:03,054 INFO L226 Difference]: Without dead ends: 4443 [2018-12-08 10:53:03,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:53:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2018-12-08 10:53:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4018. [2018-12-08 10:53:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4018 states. [2018-12-08 10:53:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 9551 transitions. [2018-12-08 10:53:03,083 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 9551 transitions. Word has length 102 [2018-12-08 10:53:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:03,084 INFO L480 AbstractCegarLoop]: Abstraction has 4018 states and 9551 transitions. [2018-12-08 10:53:03,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:53:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 9551 transitions. [2018-12-08 10:53:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:03,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:03,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:03,087 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:03,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash 745143216, now seen corresponding path program 2 times [2018-12-08 10:53:03,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:03,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:03,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:53:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:03,199 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-08 10:53:03,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:53:03,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:53:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:53:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:53:03,199 INFO L87 Difference]: Start difference. First operand 4018 states and 9551 transitions. Second operand 8 states. [2018-12-08 10:53:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:03,358 INFO L93 Difference]: Finished difference Result 4445 states and 10525 transitions. [2018-12-08 10:53:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 10:53:03,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-08 10:53:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:03,362 INFO L225 Difference]: With dead ends: 4445 [2018-12-08 10:53:03,362 INFO L226 Difference]: Without dead ends: 4445 [2018-12-08 10:53:03,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:53:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2018-12-08 10:53:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4012. [2018-12-08 10:53:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2018-12-08 10:53:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 9544 transitions. [2018-12-08 10:53:03,390 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 9544 transitions. Word has length 102 [2018-12-08 10:53:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:03,390 INFO L480 AbstractCegarLoop]: Abstraction has 4012 states and 9544 transitions. [2018-12-08 10:53:03,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:53:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 9544 transitions. [2018-12-08 10:53:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:03,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:53:03,393 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:03,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1632646897, now seen corresponding path program 2 times [2018-12-08 10:53:03,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:03,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:03,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:53:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:53:03,502 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-08 10:53:03,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:53:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 10:53:03,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 10:53:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 10:53:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:53:03,503 INFO L87 Difference]: Start difference. First operand 4012 states and 9544 transitions. Second operand 13 states. [2018-12-08 10:53:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:53:03,955 INFO L93 Difference]: Finished difference Result 6515 states and 15257 transitions. [2018-12-08 10:53:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 10:53:03,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-08 10:53:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:53:03,959 INFO L225 Difference]: With dead ends: 6515 [2018-12-08 10:53:03,959 INFO L226 Difference]: Without dead ends: 4669 [2018-12-08 10:53:03,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-08 10:53:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2018-12-08 10:53:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4068. [2018-12-08 10:53:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2018-12-08 10:53:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 9606 transitions. [2018-12-08 10:53:03,990 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 9606 transitions. Word has length 102 [2018-12-08 10:53:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:53:03,990 INFO L480 AbstractCegarLoop]: Abstraction has 4068 states and 9606 transitions. [2018-12-08 10:53:03,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 10:53:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 9606 transitions. [2018-12-08 10:53:03,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 10:53:03,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:53:03,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:53:03,993 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:53:03,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:53:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1374983025, now seen corresponding path program 3 times [2018-12-08 10:53:03,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:53:03,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:53:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:03,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:53:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:53:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:53:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:53:04,035 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 10:53:04,124 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 10:53:04,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:53:04 BasicIcfg [2018-12-08 10:53:04,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 10:53:04,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:53:04,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:53:04,126 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:53:04,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:52:08" (3/4) ... [2018-12-08 10:53:04,128 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 10:53:04,224 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e3194c9e-5088-4d3e-9dd5-df1a647c5f26/bin-2019/uautomizer/witness.graphml [2018-12-08 10:53:04,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:53:04,225 INFO L168 Benchmark]: Toolchain (without parser) took 56894.14 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 951.7 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,226 INFO L168 Benchmark]: CDTParser took 0.15 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-08 10:53:04,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.01 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,227 INFO L168 Benchmark]: Boogie Preprocessor took 19.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,227 INFO L168 Benchmark]: RCFGBuilder took 390.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,227 INFO L168 Benchmark]: TraceAbstraction took 56001.32 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,227 INFO L168 Benchmark]: Witness Printer took 99.12 ms. Allocated memory is still 6.6 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:53:04,228 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.15 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 347.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.01 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 390.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56001.32 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 99.12 ms. Allocated memory is still 6.6 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1769; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1770; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 55.9s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11062 SDtfs, 13880 SDslu, 30306 SDs, 0 SdLazy, 12290 SolverSat, 692 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 73 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228356occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 30.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 370751 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2407 NumberOfCodeBlocks, 2407 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2276 ConstructedInterpolants, 0 QuantifiedInterpolants, 489454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...