./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/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 a94e9616eeec95d33f3b637918a945a848d3e6f6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:23:31,308 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:23:31,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:23:31,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:23:31,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:23:31,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:23:31,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:23:31,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:23:31,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:23:31,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:23:31,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:23:31,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:23:31,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:23:31,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:23:31,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:23:31,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:23:31,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:23:31,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:23:31,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:23:31,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:23:31,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:23:31,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:23:31,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:23:31,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:23:31,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:23:31,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:23:31,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:23:31,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:23:31,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:23:31,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:23:31,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:23:31,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:23:31,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:23:31,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:23:31,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:23:31,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:23:31,329 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 15:23:31,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:23:31,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:23:31,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:23:31,337 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:23:31,337 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:23:31,337 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:23:31,337 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:23:31,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:23:31,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:23:31,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:23:31,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:23:31,339 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:23:31,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:23:31,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:23:31,340 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_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/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 -> a94e9616eeec95d33f3b637918a945a848d3e6f6 [2018-12-02 15:23:31,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:23:31,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:23:31,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:23:31,370 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:23:31,371 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:23:31,371 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i [2018-12-02 15:23:31,405 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/data/14bdcfa66/4cc24f116b8f4d7c87cfdd06e46a8497/FLAGaec3f6f00 [2018-12-02 15:23:31,738 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:23:31,738 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i [2018-12-02 15:23:31,746 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/data/14bdcfa66/4cc24f116b8f4d7c87cfdd06e46a8497/FLAGaec3f6f00 [2018-12-02 15:23:31,755 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/data/14bdcfa66/4cc24f116b8f4d7c87cfdd06e46a8497 [2018-12-02 15:23:31,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:23:31,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:23:31,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:23:31,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:23:31,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:23:31,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:23:31" (1/1) ... [2018-12-02 15:23:31,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11953753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:31, skipping insertion in model container [2018-12-02 15:23:31,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:23:31" (1/1) ... [2018-12-02 15:23:31,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:23:31,788 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:23:31,978 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:23:31,986 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:23:32,074 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:23:32,112 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:23:32,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32 WrapperNode [2018-12-02 15:23:32,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:23:32,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:23:32,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:23:32,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:23:32,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:23:32,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:23:32,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:23:32,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:23:32,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... [2018-12-02 15:23:32,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:23:32,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:23:32,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:23:32,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:23:32,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 15:23:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 15:23:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 15:23:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:23:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:23:32,198 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 15:23:32,539 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:23:32,539 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 15:23:32,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:23:32 BoogieIcfgContainer [2018-12-02 15:23:32,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:23:32,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:23:32,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:23:32,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:23:32,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:23:31" (1/3) ... [2018-12-02 15:23:32,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69976ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:23:32, skipping insertion in model container [2018-12-02 15:23:32,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:32" (2/3) ... [2018-12-02 15:23:32,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69976ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:23:32, skipping insertion in model container [2018-12-02 15:23:32,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:23:32" (3/3) ... [2018-12-02 15:23:32,544 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc_false-unreach-call.i [2018-12-02 15:23:32,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,574 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,574 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,574 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:23:32,609 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 15:23:32,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:23:32,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 15:23:32,623 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 15:23:32,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:23:32,637 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:23:32,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 15:23:32,638 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:23:32,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:23:32,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:23:32,638 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:23:32,638 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:23:32,638 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:23:32,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-02 15:23:39,982 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-02 15:23:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-02 15:23:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:23:39,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:23:39,988 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] [2018-12-02 15:23:39,990 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:23:39,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2018-12-02 15:23:39,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:40,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:23:40,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:23:40,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:23:40,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:23:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:23:40,139 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-02 15:23:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:23:41,126 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-02 15:23:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:23:41,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 15:23:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:23:41,577 INFO L225 Difference]: With dead ends: 192000 [2018-12-02 15:23:41,577 INFO L226 Difference]: Without dead ends: 135832 [2018-12-02 15:23:41,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:23:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-02 15:23:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-02 15:23:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-02 15:23:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-02 15:23:44,421 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-02 15:23:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:23:44,421 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-02 15:23:44,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:23:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-02 15:23:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 15:23:44,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:23:44,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:23:44,427 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:23:44,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2018-12-02 15:23:44,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:44,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:23:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:23:44,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:23:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:23:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:23:44,482 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-02 15:23:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:23:47,077 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-02 15:23:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:23:47,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 15:23:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:23:47,505 INFO L225 Difference]: With dead ends: 195844 [2018-12-02 15:23:47,505 INFO L226 Difference]: Without dead ends: 195292 [2018-12-02 15:23:47,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:23:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-02 15:23:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-02 15:23:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-02 15:23:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-02 15:23:50,926 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-02 15:23:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:23:50,926 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-02 15:23:50,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:23:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-02 15:23:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 15:23:50,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:23:50,930 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] [2018-12-02 15:23:50,930 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:23:50,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2018-12-02 15:23:50,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:50,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:50,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:50,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:50,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:50,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:23:50,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:23:50,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:23:50,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:23:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:23:50,971 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-02 15:23:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:23:52,410 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-02 15:23:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:23:52,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 15:23:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:23:52,944 INFO L225 Difference]: With dead ends: 253868 [2018-12-02 15:23:52,944 INFO L226 Difference]: Without dead ends: 253356 [2018-12-02 15:23:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:23:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-02 15:23:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-02 15:23:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-02 15:23:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-02 15:23:57,224 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-02 15:23:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:23:57,224 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-02 15:23:57,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:23:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-02 15:23:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 15:23:57,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:23:57,230 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] [2018-12-02 15:23:57,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:23:57,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:57,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2018-12-02 15:23:57,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:57,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:57,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:57,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:57,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:57,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:23:57,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:23:57,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:23:57,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:23:57,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:23:57,263 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-02 15:23:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:23:59,839 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-02 15:23:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:23:59,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 15:23:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:00,293 INFO L225 Difference]: With dead ends: 234162 [2018-12-02 15:24:00,293 INFO L226 Difference]: Without dead ends: 234162 [2018-12-02 15:24:00,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-02 15:24:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-02 15:24:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-02 15:24:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-02 15:24:05,012 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-02 15:24:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:05,012 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-02 15:24:05,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:24:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-02 15:24:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:24:05,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:05,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:05,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:05,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2018-12-02 15:24:05,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:05,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:05,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:05,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:24:05,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:24:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:24:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:24:05,086 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-02 15:24:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:07,675 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-02 15:24:07,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:24:07,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 15:24:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:08,514 INFO L225 Difference]: With dead ends: 402833 [2018-12-02 15:24:08,514 INFO L226 Difference]: Without dead ends: 402257 [2018-12-02 15:24:08,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 15:24:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-02 15:24:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-02 15:24:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-02 15:24:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-02 15:24:18,134 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-02 15:24:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:18,134 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-02 15:24:18,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:24:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-02 15:24:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:24:18,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:18,149 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] [2018-12-02 15:24:18,149 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 8397738, now seen corresponding path program 1 times [2018-12-02 15:24:18,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:18,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:18,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:18,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:18,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:18,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:18,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:18,213 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-02 15:24:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:20,058 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-02 15:24:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:24:20,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-02 15:24:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:20,745 INFO L225 Difference]: With dead ends: 325852 [2018-12-02 15:24:20,745 INFO L226 Difference]: Without dead ends: 325852 [2018-12-02 15:24:20,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:24:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-02 15:24:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-02 15:24:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-02 15:24:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-02 15:24:29,530 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-02 15:24:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:29,530 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-02 15:24:29,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-02 15:24:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:24:29,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:29,548 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] [2018-12-02 15:24:29,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:29,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:29,548 INFO L82 PathProgramCache]: Analyzing trace with hash 895901419, now seen corresponding path program 1 times [2018-12-02 15:24:29,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:29,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:29,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:29,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:29,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:24:29,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:24:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:24:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:29,581 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 4 states. [2018-12-02 15:24:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:29,693 INFO L93 Difference]: Finished difference Result 40004 states and 128000 transitions. [2018-12-02 15:24:29,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:24:29,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 15:24:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:29,736 INFO L225 Difference]: With dead ends: 40004 [2018-12-02 15:24:29,736 INFO L226 Difference]: Without dead ends: 32121 [2018-12-02 15:24:29,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2018-12-02 15:24:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 31856. [2018-12-02 15:24:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31856 states. [2018-12-02 15:24:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31856 states to 31856 states and 99339 transitions. [2018-12-02 15:24:30,093 INFO L78 Accepts]: Start accepts. Automaton has 31856 states and 99339 transitions. Word has length 54 [2018-12-02 15:24:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:30,094 INFO L480 AbstractCegarLoop]: Abstraction has 31856 states and 99339 transitions. [2018-12-02 15:24:30,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:24:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 31856 states and 99339 transitions. [2018-12-02 15:24:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 15:24:30,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:30,097 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] [2018-12-02 15:24:30,097 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:30,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2018-12-02 15:24:30,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:30,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:30,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:30,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:24:30,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:24:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:24:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:30,143 INFO L87 Difference]: Start difference. First operand 31856 states and 99339 transitions. Second operand 4 states. [2018-12-02 15:24:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:30,338 INFO L93 Difference]: Finished difference Result 37101 states and 115387 transitions. [2018-12-02 15:24:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:24:30,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 15:24:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:30,384 INFO L225 Difference]: With dead ends: 37101 [2018-12-02 15:24:30,384 INFO L226 Difference]: Without dead ends: 37101 [2018-12-02 15:24:30,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2018-12-02 15:24:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 36125. [2018-12-02 15:24:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36125 states. [2018-12-02 15:24:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36125 states to 36125 states and 112472 transitions. [2018-12-02 15:24:30,793 INFO L78 Accepts]: Start accepts. Automaton has 36125 states and 112472 transitions. Word has length 62 [2018-12-02 15:24:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:30,793 INFO L480 AbstractCegarLoop]: Abstraction has 36125 states and 112472 transitions. [2018-12-02 15:24:30,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:24:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 36125 states and 112472 transitions. [2018-12-02 15:24:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 15:24:30,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:30,797 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] [2018-12-02 15:24:30,797 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:30,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2018-12-02 15:24:30,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:30,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:30,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:30,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:24:30,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:24:30,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:24:30,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:24:30,865 INFO L87 Difference]: Start difference. First operand 36125 states and 112472 transitions. Second operand 6 states. [2018-12-02 15:24:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:31,667 INFO L93 Difference]: Finished difference Result 74227 states and 229198 transitions. [2018-12-02 15:24:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:24:31,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 15:24:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:31,763 INFO L225 Difference]: With dead ends: 74227 [2018-12-02 15:24:31,763 INFO L226 Difference]: Without dead ends: 74156 [2018-12-02 15:24:31,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:24:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74156 states. [2018-12-02 15:24:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74156 to 44213. [2018-12-02 15:24:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44213 states. [2018-12-02 15:24:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44213 states to 44213 states and 135208 transitions. [2018-12-02 15:24:32,393 INFO L78 Accepts]: Start accepts. Automaton has 44213 states and 135208 transitions. Word has length 62 [2018-12-02 15:24:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:32,394 INFO L480 AbstractCegarLoop]: Abstraction has 44213 states and 135208 transitions. [2018-12-02 15:24:32,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:24:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 44213 states and 135208 transitions. [2018-12-02 15:24:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 15:24:32,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:32,400 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] [2018-12-02 15:24:32,401 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:32,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2018-12-02 15:24:32,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:32,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:32,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:32,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:24:32,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:24:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:24:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:32,430 INFO L87 Difference]: Start difference. First operand 44213 states and 135208 transitions. Second operand 3 states. [2018-12-02 15:24:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:32,604 INFO L93 Difference]: Finished difference Result 55070 states and 166417 transitions. [2018-12-02 15:24:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:24:32,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 15:24:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:32,675 INFO L225 Difference]: With dead ends: 55070 [2018-12-02 15:24:32,676 INFO L226 Difference]: Without dead ends: 55070 [2018-12-02 15:24:32,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55070 states. [2018-12-02 15:24:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55070 to 45329. [2018-12-02 15:24:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45329 states. [2018-12-02 15:24:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45329 states to 45329 states and 135858 transitions. [2018-12-02 15:24:33,222 INFO L78 Accepts]: Start accepts. Automaton has 45329 states and 135858 transitions. Word has length 68 [2018-12-02 15:24:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:33,223 INFO L480 AbstractCegarLoop]: Abstraction has 45329 states and 135858 transitions. [2018-12-02 15:24:33,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:24:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45329 states and 135858 transitions. [2018-12-02 15:24:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 15:24:33,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:33,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:33,232 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:33,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2018-12-02 15:24:33,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:33,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:33,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:24:33,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:24:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:24:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:33,285 INFO L87 Difference]: Start difference. First operand 45329 states and 135858 transitions. Second operand 5 states. [2018-12-02 15:24:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:33,597 INFO L93 Difference]: Finished difference Result 51158 states and 153082 transitions. [2018-12-02 15:24:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:24:33,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-02 15:24:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:33,656 INFO L225 Difference]: With dead ends: 51158 [2018-12-02 15:24:33,657 INFO L226 Difference]: Without dead ends: 51158 [2018-12-02 15:24:33,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:24:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2018-12-02 15:24:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 45794. [2018-12-02 15:24:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45794 states. [2018-12-02 15:24:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45794 states to 45794 states and 137141 transitions. [2018-12-02 15:24:34,417 INFO L78 Accepts]: Start accepts. Automaton has 45794 states and 137141 transitions. Word has length 74 [2018-12-02 15:24:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:34,418 INFO L480 AbstractCegarLoop]: Abstraction has 45794 states and 137141 transitions. [2018-12-02 15:24:34,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:24:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 45794 states and 137141 transitions. [2018-12-02 15:24:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 15:24:34,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:34,427 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] [2018-12-02 15:24:34,427 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:34,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2018-12-02 15:24:34,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:34,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:34,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:34,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:34,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:34,469 INFO L87 Difference]: Start difference. First operand 45794 states and 137141 transitions. Second operand 7 states. [2018-12-02 15:24:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:35,040 INFO L93 Difference]: Finished difference Result 54436 states and 163097 transitions. [2018-12-02 15:24:35,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:24:35,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 15:24:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:35,111 INFO L225 Difference]: With dead ends: 54436 [2018-12-02 15:24:35,111 INFO L226 Difference]: Without dead ends: 54349 [2018-12-02 15:24:35,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 15:24:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54349 states. [2018-12-02 15:24:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54349 to 42854. [2018-12-02 15:24:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42854 states. [2018-12-02 15:24:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42854 states to 42854 states and 129588 transitions. [2018-12-02 15:24:35,644 INFO L78 Accepts]: Start accepts. Automaton has 42854 states and 129588 transitions. Word has length 74 [2018-12-02 15:24:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:35,645 INFO L480 AbstractCegarLoop]: Abstraction has 42854 states and 129588 transitions. [2018-12-02 15:24:35,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42854 states and 129588 transitions. [2018-12-02 15:24:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 15:24:35,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:35,654 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] [2018-12-02 15:24:35,654 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:35,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2018-12-02 15:24:35,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:35,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:35,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:24:35,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:24:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:24:35,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:35,687 INFO L87 Difference]: Start difference. First operand 42854 states and 129588 transitions. Second operand 4 states. [2018-12-02 15:24:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:36,200 INFO L93 Difference]: Finished difference Result 56907 states and 168235 transitions. [2018-12-02 15:24:36,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:24:36,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 15:24:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:36,268 INFO L225 Difference]: With dead ends: 56907 [2018-12-02 15:24:36,268 INFO L226 Difference]: Without dead ends: 56907 [2018-12-02 15:24:36,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56907 states. [2018-12-02 15:24:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56907 to 51423. [2018-12-02 15:24:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51423 states. [2018-12-02 15:24:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51423 states to 51423 states and 153222 transitions. [2018-12-02 15:24:37,181 INFO L78 Accepts]: Start accepts. Automaton has 51423 states and 153222 transitions. Word has length 76 [2018-12-02 15:24:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:37,181 INFO L480 AbstractCegarLoop]: Abstraction has 51423 states and 153222 transitions. [2018-12-02 15:24:37,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:24:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 51423 states and 153222 transitions. [2018-12-02 15:24:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 15:24:37,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:37,193 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] [2018-12-02 15:24:37,193 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:37,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2018-12-02 15:24:37,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:37,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:37,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:37,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:37,248 INFO L87 Difference]: Start difference. First operand 51423 states and 153222 transitions. Second operand 7 states. [2018-12-02 15:24:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:38,183 INFO L93 Difference]: Finished difference Result 106618 states and 315348 transitions. [2018-12-02 15:24:38,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 15:24:38,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-02 15:24:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:38,324 INFO L225 Difference]: With dead ends: 106618 [2018-12-02 15:24:38,324 INFO L226 Difference]: Without dead ends: 106554 [2018-12-02 15:24:38,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-02 15:24:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106554 states. [2018-12-02 15:24:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106554 to 56647. [2018-12-02 15:24:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56647 states. [2018-12-02 15:24:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56647 states to 56647 states and 166937 transitions. [2018-12-02 15:24:39,336 INFO L78 Accepts]: Start accepts. Automaton has 56647 states and 166937 transitions. Word has length 76 [2018-12-02 15:24:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:39,336 INFO L480 AbstractCegarLoop]: Abstraction has 56647 states and 166937 transitions. [2018-12-02 15:24:39,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 56647 states and 166937 transitions. [2018-12-02 15:24:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 15:24:39,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:39,360 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] [2018-12-02 15:24:39,360 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:39,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash 153257945, now seen corresponding path program 1 times [2018-12-02 15:24:39,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:39,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:39,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:39,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:39,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:39,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:24:39,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:24:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:24:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:39,402 INFO L87 Difference]: Start difference. First operand 56647 states and 166937 transitions. Second operand 4 states. [2018-12-02 15:24:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:39,705 INFO L93 Difference]: Finished difference Result 62874 states and 184413 transitions. [2018-12-02 15:24:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:24:39,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 15:24:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:39,781 INFO L225 Difference]: With dead ends: 62874 [2018-12-02 15:24:39,781 INFO L226 Difference]: Without dead ends: 62874 [2018-12-02 15:24:39,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62874 states. [2018-12-02 15:24:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62874 to 61596. [2018-12-02 15:24:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61596 states. [2018-12-02 15:24:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61596 states to 61596 states and 180682 transitions. [2018-12-02 15:24:40,479 INFO L78 Accepts]: Start accepts. Automaton has 61596 states and 180682 transitions. Word has length 82 [2018-12-02 15:24:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:40,479 INFO L480 AbstractCegarLoop]: Abstraction has 61596 states and 180682 transitions. [2018-12-02 15:24:40,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:24:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 61596 states and 180682 transitions. [2018-12-02 15:24:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 15:24:40,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:40,505 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] [2018-12-02 15:24:40,505 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:40,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1923951398, now seen corresponding path program 1 times [2018-12-02 15:24:40,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:40,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:40,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:24:40,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:24:40,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:24:40,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:40,535 INFO L87 Difference]: Start difference. First operand 61596 states and 180682 transitions. Second operand 3 states. [2018-12-02 15:24:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:40,828 INFO L93 Difference]: Finished difference Result 73882 states and 212774 transitions. [2018-12-02 15:24:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:24:40,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-02 15:24:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:40,916 INFO L225 Difference]: With dead ends: 73882 [2018-12-02 15:24:40,916 INFO L226 Difference]: Without dead ends: 73882 [2018-12-02 15:24:40,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73882 states. [2018-12-02 15:24:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73882 to 69194. [2018-12-02 15:24:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69194 states. [2018-12-02 15:24:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69194 states to 69194 states and 200395 transitions. [2018-12-02 15:24:41,740 INFO L78 Accepts]: Start accepts. Automaton has 69194 states and 200395 transitions. Word has length 82 [2018-12-02 15:24:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 69194 states and 200395 transitions. [2018-12-02 15:24:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:24:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69194 states and 200395 transitions. [2018-12-02 15:24:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 15:24:41,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:41,768 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] [2018-12-02 15:24:41,768 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:41,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1319576706, now seen corresponding path program 1 times [2018-12-02 15:24:41,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:41,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:24:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:24:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:24:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:41,808 INFO L87 Difference]: Start difference. First operand 69194 states and 200395 transitions. Second operand 4 states. [2018-12-02 15:24:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:42,036 INFO L93 Difference]: Finished difference Result 75677 states and 216537 transitions. [2018-12-02 15:24:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:24:42,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 15:24:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:42,125 INFO L225 Difference]: With dead ends: 75677 [2018-12-02 15:24:42,125 INFO L226 Difference]: Without dead ends: 75677 [2018-12-02 15:24:42,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75677 states. [2018-12-02 15:24:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75677 to 70724. [2018-12-02 15:24:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70724 states. [2018-12-02 15:24:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70724 states to 70724 states and 202400 transitions. [2018-12-02 15:24:43,099 INFO L78 Accepts]: Start accepts. Automaton has 70724 states and 202400 transitions. Word has length 83 [2018-12-02 15:24:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:43,099 INFO L480 AbstractCegarLoop]: Abstraction has 70724 states and 202400 transitions. [2018-12-02 15:24:43,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:24:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 70724 states and 202400 transitions. [2018-12-02 15:24:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 15:24:43,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:43,121 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] [2018-12-02 15:24:43,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:43,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:43,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1201211927, now seen corresponding path program 1 times [2018-12-02 15:24:43,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:43,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:43,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:43,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:43,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:43,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:43,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:24:43,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:24:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:24:43,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:24:43,153 INFO L87 Difference]: Start difference. First operand 70724 states and 202400 transitions. Second operand 4 states. [2018-12-02 15:24:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:43,358 INFO L93 Difference]: Finished difference Result 76557 states and 218374 transitions. [2018-12-02 15:24:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:24:43,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 15:24:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:43,448 INFO L225 Difference]: With dead ends: 76557 [2018-12-02 15:24:43,449 INFO L226 Difference]: Without dead ends: 76557 [2018-12-02 15:24:43,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76557 states. [2018-12-02 15:24:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76557 to 71702. [2018-12-02 15:24:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-12-02 15:24:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-12-02 15:24:44,249 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-12-02 15:24:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:44,249 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-12-02 15:24:44,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:24:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-12-02 15:24:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 15:24:44,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:44,275 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] [2018-12-02 15:24:44,276 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:44,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:44,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2103727433, now seen corresponding path program 1 times [2018-12-02 15:24:44,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:44,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:44,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:44,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:44,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 15:24:44,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 15:24:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:24:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:24:44,344 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-12-02 15:24:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:46,809 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-12-02 15:24:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 15:24:46,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-02 15:24:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:47,019 INFO L225 Difference]: With dead ends: 164487 [2018-12-02 15:24:47,019 INFO L226 Difference]: Without dead ends: 164487 [2018-12-02 15:24:47,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-12-02 15:24:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-12-02 15:24:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-12-02 15:24:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-12-02 15:24:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-12-02 15:24:48,682 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-12-02 15:24:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:48,683 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-12-02 15:24:48,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 15:24:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-12-02 15:24:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 15:24:48,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:48,720 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] [2018-12-02 15:24:48,720 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:48,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1216223752, now seen corresponding path program 1 times [2018-12-02 15:24:48,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:48,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:48,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:48,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:24:48,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:24:48,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:24:48,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:48,770 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 5 states. [2018-12-02 15:24:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:48,959 INFO L93 Difference]: Finished difference Result 35805 states and 86792 transitions. [2018-12-02 15:24:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:24:48,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-02 15:24:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:48,980 INFO L225 Difference]: With dead ends: 35805 [2018-12-02 15:24:48,980 INFO L226 Difference]: Without dead ends: 31165 [2018-12-02 15:24:48,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2018-12-02 15:24:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 26658. [2018-12-02 15:24:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2018-12-02 15:24:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 63590 transitions. [2018-12-02 15:24:49,239 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 63590 transitions. Word has length 83 [2018-12-02 15:24:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:49,239 INFO L480 AbstractCegarLoop]: Abstraction has 26658 states and 63590 transitions. [2018-12-02 15:24:49,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:24:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 63590 transitions. [2018-12-02 15:24:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 15:24:49,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:49,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:49,260 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:49,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:49,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2081858008, now seen corresponding path program 1 times [2018-12-02 15:24:49,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:49,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:49,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:49,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:49,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:24:49,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:24:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:24:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:49,339 INFO L87 Difference]: Start difference. First operand 26658 states and 63590 transitions. Second operand 5 states. [2018-12-02 15:24:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:49,445 INFO L93 Difference]: Finished difference Result 30725 states and 72487 transitions. [2018-12-02 15:24:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:24:49,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 15:24:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:49,472 INFO L225 Difference]: With dead ends: 30725 [2018-12-02 15:24:49,473 INFO L226 Difference]: Without dead ends: 30725 [2018-12-02 15:24:49,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2018-12-02 15:24:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 24444. [2018-12-02 15:24:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24444 states. [2018-12-02 15:24:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24444 states to 24444 states and 57727 transitions. [2018-12-02 15:24:49,726 INFO L78 Accepts]: Start accepts. Automaton has 24444 states and 57727 transitions. Word has length 111 [2018-12-02 15:24:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:49,726 INFO L480 AbstractCegarLoop]: Abstraction has 24444 states and 57727 transitions. [2018-12-02 15:24:49,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:24:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 24444 states and 57727 transitions. [2018-12-02 15:24:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 15:24:49,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:49,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:49,746 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:49,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1752092247, now seen corresponding path program 1 times [2018-12-02 15:24:49,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:49,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:49,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:49,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:49,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:24:49,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:24:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:24:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:49,784 INFO L87 Difference]: Start difference. First operand 24444 states and 57727 transitions. Second operand 5 states. [2018-12-02 15:24:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:50,263 INFO L93 Difference]: Finished difference Result 47080 states and 111201 transitions. [2018-12-02 15:24:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:24:50,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 15:24:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:50,299 INFO L225 Difference]: With dead ends: 47080 [2018-12-02 15:24:50,299 INFO L226 Difference]: Without dead ends: 47046 [2018-12-02 15:24:50,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47046 states. [2018-12-02 15:24:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47046 to 31533. [2018-12-02 15:24:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31533 states. [2018-12-02 15:24:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31533 states to 31533 states and 75074 transitions. [2018-12-02 15:24:50,670 INFO L78 Accepts]: Start accepts. Automaton has 31533 states and 75074 transitions. Word has length 111 [2018-12-02 15:24:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:50,670 INFO L480 AbstractCegarLoop]: Abstraction has 31533 states and 75074 transitions. [2018-12-02 15:24:50,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:24:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31533 states and 75074 transitions. [2018-12-02 15:24:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 15:24:50,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:50,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:50,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:50,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 532771208, now seen corresponding path program 1 times [2018-12-02 15:24:50,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:50,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:50,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:50,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:50,771 INFO L87 Difference]: Start difference. First operand 31533 states and 75074 transitions. Second operand 7 states. [2018-12-02 15:24:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:51,227 INFO L93 Difference]: Finished difference Result 42647 states and 99851 transitions. [2018-12-02 15:24:51,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 15:24:51,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-02 15:24:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:51,257 INFO L225 Difference]: With dead ends: 42647 [2018-12-02 15:24:51,258 INFO L226 Difference]: Without dead ends: 42647 [2018-12-02 15:24:51,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:24:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42647 states. [2018-12-02 15:24:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42647 to 35641. [2018-12-02 15:24:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35641 states. [2018-12-02 15:24:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35641 states to 35641 states and 83844 transitions. [2018-12-02 15:24:51,613 INFO L78 Accepts]: Start accepts. Automaton has 35641 states and 83844 transitions. Word has length 111 [2018-12-02 15:24:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:51,613 INFO L480 AbstractCegarLoop]: Abstraction has 35641 states and 83844 transitions. [2018-12-02 15:24:51,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 35641 states and 83844 transitions. [2018-12-02 15:24:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 15:24:51,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:51,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:51,641 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:51,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:51,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1528998322, now seen corresponding path program 2 times [2018-12-02 15:24:51,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:51,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:51,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:51,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:51,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:24:51,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:24:51,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:24:51,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:24:51,692 INFO L87 Difference]: Start difference. First operand 35641 states and 83844 transitions. Second operand 5 states. [2018-12-02 15:24:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:51,915 INFO L93 Difference]: Finished difference Result 36166 states and 85001 transitions. [2018-12-02 15:24:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:24:51,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 15:24:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:51,947 INFO L225 Difference]: With dead ends: 36166 [2018-12-02 15:24:51,947 INFO L226 Difference]: Without dead ends: 36166 [2018-12-02 15:24:51,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36166 states. [2018-12-02 15:24:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36166 to 35927. [2018-12-02 15:24:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35927 states. [2018-12-02 15:24:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35927 states to 35927 states and 84490 transitions. [2018-12-02 15:24:52,274 INFO L78 Accepts]: Start accepts. Automaton has 35927 states and 84490 transitions. Word has length 111 [2018-12-02 15:24:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:52,274 INFO L480 AbstractCegarLoop]: Abstraction has 35927 states and 84490 transitions. [2018-12-02 15:24:52,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:24:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35927 states and 84490 transitions. [2018-12-02 15:24:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 15:24:52,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:52,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:52,301 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:52,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2020120248, now seen corresponding path program 1 times [2018-12-02 15:24:52,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:52,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:52,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:52,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:24:52,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:52,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:52,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:52,394 INFO L87 Difference]: Start difference. First operand 35927 states and 84490 transitions. Second operand 7 states. [2018-12-02 15:24:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:52,662 INFO L93 Difference]: Finished difference Result 50459 states and 117298 transitions. [2018-12-02 15:24:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:24:52,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 15:24:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:52,702 INFO L225 Difference]: With dead ends: 50459 [2018-12-02 15:24:52,702 INFO L226 Difference]: Without dead ends: 50459 [2018-12-02 15:24:52,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:24:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50459 states. [2018-12-02 15:24:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50459 to 39432. [2018-12-02 15:24:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39432 states. [2018-12-02 15:24:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39432 states to 39432 states and 92455 transitions. [2018-12-02 15:24:53,097 INFO L78 Accepts]: Start accepts. Automaton has 39432 states and 92455 transitions. Word has length 113 [2018-12-02 15:24:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:53,097 INFO L480 AbstractCegarLoop]: Abstraction has 39432 states and 92455 transitions. [2018-12-02 15:24:53,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 39432 states and 92455 transitions. [2018-12-02 15:24:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 15:24:53,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:53,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:53,124 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:53,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash 264743207, now seen corresponding path program 1 times [2018-12-02 15:24:53,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:53,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:53,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:53,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:53,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:53,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:53,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:53,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:53,203 INFO L87 Difference]: Start difference. First operand 39432 states and 92455 transitions. Second operand 7 states. [2018-12-02 15:24:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:53,662 INFO L93 Difference]: Finished difference Result 47592 states and 111826 transitions. [2018-12-02 15:24:53,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:24:53,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 15:24:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:53,697 INFO L225 Difference]: With dead ends: 47592 [2018-12-02 15:24:53,697 INFO L226 Difference]: Without dead ends: 47592 [2018-12-02 15:24:53,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:24:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47592 states. [2018-12-02 15:24:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47592 to 41368. [2018-12-02 15:24:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41368 states. [2018-12-02 15:24:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41368 states to 41368 states and 97336 transitions. [2018-12-02 15:24:54,103 INFO L78 Accepts]: Start accepts. Automaton has 41368 states and 97336 transitions. Word has length 113 [2018-12-02 15:24:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:54,103 INFO L480 AbstractCegarLoop]: Abstraction has 41368 states and 97336 transitions. [2018-12-02 15:24:54,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41368 states and 97336 transitions. [2018-12-02 15:24:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 15:24:54,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:54,136 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:54,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2018-12-02 15:24:54,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:54,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:54,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:54,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:54,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:54,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:54,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:54,209 INFO L87 Difference]: Start difference. First operand 41368 states and 97336 transitions. Second operand 7 states. [2018-12-02 15:24:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:54,368 INFO L93 Difference]: Finished difference Result 46306 states and 108352 transitions. [2018-12-02 15:24:54,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:24:54,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 15:24:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:54,404 INFO L225 Difference]: With dead ends: 46306 [2018-12-02 15:24:54,404 INFO L226 Difference]: Without dead ends: 46306 [2018-12-02 15:24:54,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:24:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46306 states. [2018-12-02 15:24:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46306 to 38180. [2018-12-02 15:24:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38180 states. [2018-12-02 15:24:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38180 states to 38180 states and 89886 transitions. [2018-12-02 15:24:54,788 INFO L78 Accepts]: Start accepts. Automaton has 38180 states and 89886 transitions. Word has length 113 [2018-12-02 15:24:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:54,788 INFO L480 AbstractCegarLoop]: Abstraction has 38180 states and 89886 transitions. [2018-12-02 15:24:54,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 38180 states and 89886 transitions. [2018-12-02 15:24:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 15:24:54,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:54,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:54,816 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:54,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1486128550, now seen corresponding path program 1 times [2018-12-02 15:24:54,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:54,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:54,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:54,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:24:54,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:24:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:24:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:24:54,870 INFO L87 Difference]: Start difference. First operand 38180 states and 89886 transitions. Second operand 6 states. [2018-12-02 15:24:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:55,009 INFO L93 Difference]: Finished difference Result 38036 states and 89302 transitions. [2018-12-02 15:24:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:24:55,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 15:24:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:55,036 INFO L225 Difference]: With dead ends: 38036 [2018-12-02 15:24:55,036 INFO L226 Difference]: Without dead ends: 38036 [2018-12-02 15:24:55,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:24:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38036 states. [2018-12-02 15:24:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38036 to 32988. [2018-12-02 15:24:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32988 states. [2018-12-02 15:24:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32988 states to 32988 states and 77844 transitions. [2018-12-02 15:24:55,360 INFO L78 Accepts]: Start accepts. Automaton has 32988 states and 77844 transitions. Word has length 113 [2018-12-02 15:24:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:55,360 INFO L480 AbstractCegarLoop]: Abstraction has 32988 states and 77844 transitions. [2018-12-02 15:24:55,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:24:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32988 states and 77844 transitions. [2018-12-02 15:24:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 15:24:55,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:55,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:55,386 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:55,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1144106883, now seen corresponding path program 1 times [2018-12-02 15:24:55,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:55,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:55,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:55,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:55,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:55,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:55,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:24:55,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:24:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:24:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:24:55,445 INFO L87 Difference]: Start difference. First operand 32988 states and 77844 transitions. Second operand 6 states. [2018-12-02 15:24:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:55,769 INFO L93 Difference]: Finished difference Result 36724 states and 85922 transitions. [2018-12-02 15:24:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:24:55,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 15:24:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:55,798 INFO L225 Difference]: With dead ends: 36724 [2018-12-02 15:24:55,798 INFO L226 Difference]: Without dead ends: 36724 [2018-12-02 15:24:55,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:24:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36724 states. [2018-12-02 15:24:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36724 to 33071. [2018-12-02 15:24:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33071 states. [2018-12-02 15:24:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33071 states to 33071 states and 77999 transitions. [2018-12-02 15:24:56,109 INFO L78 Accepts]: Start accepts. Automaton has 33071 states and 77999 transitions. Word has length 113 [2018-12-02 15:24:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:56,109 INFO L480 AbstractCegarLoop]: Abstraction has 33071 states and 77999 transitions. [2018-12-02 15:24:56,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:24:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33071 states and 77999 transitions. [2018-12-02 15:24:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:24:56,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:56,135 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:56,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:56,136 INFO L82 PathProgramCache]: Analyzing trace with hash -779122372, now seen corresponding path program 1 times [2018-12-02 15:24:56,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:56,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:56,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:56,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:56,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-02 15:24:56,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:56,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:56,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:56,219 INFO L87 Difference]: Start difference. First operand 33071 states and 77999 transitions. Second operand 7 states. [2018-12-02 15:24:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:56,487 INFO L93 Difference]: Finished difference Result 40784 states and 93893 transitions. [2018-12-02 15:24:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:24:56,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 15:24:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:56,522 INFO L225 Difference]: With dead ends: 40784 [2018-12-02 15:24:56,522 INFO L226 Difference]: Without dead ends: 40751 [2018-12-02 15:24:56,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:24:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40751 states. [2018-12-02 15:24:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40751 to 34386. [2018-12-02 15:24:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34386 states. [2018-12-02 15:24:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34386 states to 34386 states and 79866 transitions. [2018-12-02 15:24:56,868 INFO L78 Accepts]: Start accepts. Automaton has 34386 states and 79866 transitions. Word has length 115 [2018-12-02 15:24:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:56,869 INFO L480 AbstractCegarLoop]: Abstraction has 34386 states and 79866 transitions. [2018-12-02 15:24:56,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 34386 states and 79866 transitions. [2018-12-02 15:24:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:24:56,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:56,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:56,894 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:56,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -86020675, now seen corresponding path program 1 times [2018-12-02 15:24:56,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:56,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:56,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:56,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:56,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:56,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:56,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:56,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:56,960 INFO L87 Difference]: Start difference. First operand 34386 states and 79866 transitions. Second operand 7 states. [2018-12-02 15:24:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:57,299 INFO L93 Difference]: Finished difference Result 41931 states and 95543 transitions. [2018-12-02 15:24:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:24:57,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 15:24:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:57,331 INFO L225 Difference]: With dead ends: 41931 [2018-12-02 15:24:57,331 INFO L226 Difference]: Without dead ends: 41931 [2018-12-02 15:24:57,331 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-02 15:24:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41931 states. [2018-12-02 15:24:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41931 to 36885. [2018-12-02 15:24:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36885 states. [2018-12-02 15:24:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 84600 transitions. [2018-12-02 15:24:57,700 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 84600 transitions. Word has length 115 [2018-12-02 15:24:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:57,700 INFO L480 AbstractCegarLoop]: Abstraction has 36885 states and 84600 transitions. [2018-12-02 15:24:57,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 84600 transitions. [2018-12-02 15:24:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:24:57,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:57,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:57,728 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:57,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2131737278, now seen corresponding path program 1 times [2018-12-02 15:24:57,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:57,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:57,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:24:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:24:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:24:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:24:57,799 INFO L87 Difference]: Start difference. First operand 36885 states and 84600 transitions. Second operand 7 states. [2018-12-02 15:24:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:57,998 INFO L93 Difference]: Finished difference Result 37953 states and 86899 transitions. [2018-12-02 15:24:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:24:57,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 15:24:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:58,027 INFO L225 Difference]: With dead ends: 37953 [2018-12-02 15:24:58,028 INFO L226 Difference]: Without dead ends: 37953 [2018-12-02 15:24:58,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:24:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37953 states. [2018-12-02 15:24:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37953 to 37315. [2018-12-02 15:24:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37315 states. [2018-12-02 15:24:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37315 states to 37315 states and 85602 transitions. [2018-12-02 15:24:58,366 INFO L78 Accepts]: Start accepts. Automaton has 37315 states and 85602 transitions. Word has length 115 [2018-12-02 15:24:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:58,366 INFO L480 AbstractCegarLoop]: Abstraction has 37315 states and 85602 transitions. [2018-12-02 15:24:58,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:24:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 37315 states and 85602 transitions. [2018-12-02 15:24:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:24:58,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:58,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:58,394 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:58,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:58,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1275726337, now seen corresponding path program 1 times [2018-12-02 15:24:58,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:58,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:58,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:58,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:58,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:58,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:58,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:24:58,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:24:58,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:24:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:58,426 INFO L87 Difference]: Start difference. First operand 37315 states and 85602 transitions. Second operand 3 states. [2018-12-02 15:24:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:58,510 INFO L93 Difference]: Finished difference Result 46880 states and 106449 transitions. [2018-12-02 15:24:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:24:58,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-02 15:24:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:58,546 INFO L225 Difference]: With dead ends: 46880 [2018-12-02 15:24:58,546 INFO L226 Difference]: Without dead ends: 46880 [2018-12-02 15:24:58,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:24:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46880 states. [2018-12-02 15:24:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46880 to 46452. [2018-12-02 15:24:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46452 states. [2018-12-02 15:24:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46452 states to 46452 states and 105514 transitions. [2018-12-02 15:24:58,967 INFO L78 Accepts]: Start accepts. Automaton has 46452 states and 105514 transitions. Word has length 115 [2018-12-02 15:24:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:24:58,967 INFO L480 AbstractCegarLoop]: Abstraction has 46452 states and 105514 transitions. [2018-12-02 15:24:58,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:24:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46452 states and 105514 transitions. [2018-12-02 15:24:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:24:59,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:24:59,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:24:59,000 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:24:59,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:24:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash 449754560, now seen corresponding path program 1 times [2018-12-02 15:24:59,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:24:59,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:24:59,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:59,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:24:59,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:24:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:24:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:24:59,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:24:59,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 15:24:59,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 15:24:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:24:59,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:24:59,104 INFO L87 Difference]: Start difference. First operand 46452 states and 105514 transitions. Second operand 13 states. [2018-12-02 15:24:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:24:59,596 INFO L93 Difference]: Finished difference Result 74806 states and 169930 transitions. [2018-12-02 15:24:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 15:24:59,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-02 15:24:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:24:59,647 INFO L225 Difference]: With dead ends: 74806 [2018-12-02 15:24:59,647 INFO L226 Difference]: Without dead ends: 64523 [2018-12-02 15:24:59,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-12-02 15:24:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64523 states. [2018-12-02 15:25:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64523 to 53036. [2018-12-02 15:25:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53036 states. [2018-12-02 15:25:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53036 states to 53036 states and 119848 transitions. [2018-12-02 15:25:00,184 INFO L78 Accepts]: Start accepts. Automaton has 53036 states and 119848 transitions. Word has length 115 [2018-12-02 15:25:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:00,184 INFO L480 AbstractCegarLoop]: Abstraction has 53036 states and 119848 transitions. [2018-12-02 15:25:00,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 15:25:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 53036 states and 119848 transitions. [2018-12-02 15:25:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:25:00,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:00,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:25:00,227 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:00,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1473651648, now seen corresponding path program 2 times [2018-12-02 15:25:00,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:00,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:25:00,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:25:00,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 15:25:00,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 15:25:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 15:25:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:25:00,359 INFO L87 Difference]: Start difference. First operand 53036 states and 119848 transitions. Second operand 15 states. [2018-12-02 15:25:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:01,917 INFO L93 Difference]: Finished difference Result 131893 states and 299370 transitions. [2018-12-02 15:25:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 15:25:01,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-12-02 15:25:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:02,007 INFO L225 Difference]: With dead ends: 131893 [2018-12-02 15:25:02,007 INFO L226 Difference]: Without dead ends: 100948 [2018-12-02 15:25:02,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 15:25:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100948 states. [2018-12-02 15:25:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100948 to 63237. [2018-12-02 15:25:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63237 states. [2018-12-02 15:25:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63237 states to 63237 states and 141452 transitions. [2018-12-02 15:25:02,860 INFO L78 Accepts]: Start accepts. Automaton has 63237 states and 141452 transitions. Word has length 115 [2018-12-02 15:25:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:02,860 INFO L480 AbstractCegarLoop]: Abstraction has 63237 states and 141452 transitions. [2018-12-02 15:25:02,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 15:25:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63237 states and 141452 transitions. [2018-12-02 15:25:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:25:02,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:02,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:25:02,911 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:02,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1838854620, now seen corresponding path program 3 times [2018-12-02 15:25:02,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:02,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:02,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:25:02,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:25:03,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:25:03,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 15:25:03,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 15:25:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:25:03,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:25:03,024 INFO L87 Difference]: Start difference. First operand 63237 states and 141452 transitions. Second operand 13 states. [2018-12-02 15:25:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:03,704 INFO L93 Difference]: Finished difference Result 85984 states and 193282 transitions. [2018-12-02 15:25:03,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 15:25:03,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-02 15:25:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:03,764 INFO L225 Difference]: With dead ends: 85984 [2018-12-02 15:25:03,764 INFO L226 Difference]: Without dead ends: 76568 [2018-12-02 15:25:03,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 15:25:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76568 states. [2018-12-02 15:25:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76568 to 64122. [2018-12-02 15:25:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64122 states. [2018-12-02 15:25:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64122 states to 64122 states and 143468 transitions. [2018-12-02 15:25:04,468 INFO L78 Accepts]: Start accepts. Automaton has 64122 states and 143468 transitions. Word has length 115 [2018-12-02 15:25:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:04,468 INFO L480 AbstractCegarLoop]: Abstraction has 64122 states and 143468 transitions. [2018-12-02 15:25:04,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 15:25:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64122 states and 143468 transitions. [2018-12-02 15:25:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:25:04,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:04,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:25:04,520 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:04,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 250044971, now seen corresponding path program 1 times [2018-12-02 15:25:04,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:04,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:25:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:25:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:25:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:25:04,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:25:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:25:04,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:25:04,589 INFO L87 Difference]: Start difference. First operand 64122 states and 143468 transitions. Second operand 7 states. [2018-12-02 15:25:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:04,760 INFO L93 Difference]: Finished difference Result 67684 states and 151956 transitions. [2018-12-02 15:25:04,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:25:04,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 15:25:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:04,765 INFO L225 Difference]: With dead ends: 67684 [2018-12-02 15:25:04,765 INFO L226 Difference]: Without dead ends: 6571 [2018-12-02 15:25:04,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:25:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6571 states. [2018-12-02 15:25:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6571 to 6571. [2018-12-02 15:25:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6571 states. [2018-12-02 15:25:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 15301 transitions. [2018-12-02 15:25:04,809 INFO L78 Accepts]: Start accepts. Automaton has 6571 states and 15301 transitions. Word has length 115 [2018-12-02 15:25:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:04,809 INFO L480 AbstractCegarLoop]: Abstraction has 6571 states and 15301 transitions. [2018-12-02 15:25:04,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:25:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6571 states and 15301 transitions. [2018-12-02 15:25:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 15:25:04,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:04,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:25:04,814 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:04,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash 681840101, now seen corresponding path program 2 times [2018-12-02 15:25:04,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:04,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:04,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:04,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:04,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:25:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:25:04,855 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 15:25:04,932 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 15:25:04,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:25:04 BasicIcfg [2018-12-02 15:25:04,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:25:04,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:25:04,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:25:04,933 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:25:04,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:23:32" (3/4) ... [2018-12-02 15:25:04,935 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 15:25:05,015 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_405f118e-be9b-4b0e-8e6d-1dbc4f8dcd56/bin-2019/uautomizer/witness.graphml [2018-12-02 15:25:05,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:25:05,016 INFO L168 Benchmark]: Toolchain (without parser) took 93258.72 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 949.5 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: RCFGBuilder took 373.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: TraceAbstraction took 92392.73 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 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 4.3 GB. Max. memory is 11.5 GB. [2018-12-02 15:25:05,017 INFO L168 Benchmark]: Witness Printer took 82.34 ms. Allocated memory is still 7.3 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:05,018 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 373.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92392.73 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 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 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 82.34 ms. Allocated memory is still 7.3 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L794] -1 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L795] FCALL, FORK -1 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L796] -1 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L797] FCALL, FORK -1 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L721] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L721] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L721] 0 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) [L722] EXPR 0 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_p0_EBX=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=1, 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] [L722] 0 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)) [L723] EXPR 0 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_p0_EBX=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=1, 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] [L723] 0 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)) [L724] EXPR 0 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_p0_EBX=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=1, 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] [L724] 0 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)) [L725] EXPR 0 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_p0_EBX=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=1, 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] [L725] 0 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)) [L726] EXPR 0 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_p0_EBX=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=1, 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] [L726] 0 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)) [L727] EXPR 0 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_p0_EBX=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=1, 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] [L727] 0 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)) [L728] 0 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L760] EXPR 1 !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 [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L760] 1 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) [L761] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L761] 1 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)) [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L762] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L762] 1 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)) [L763] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L763] 1 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)) [L764] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L764] 1 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)) [L765] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L765] 1 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)) [L766] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L766] 1 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)) [L767] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L772] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 1 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 [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 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 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -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) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -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 [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 92.3s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 30.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17367 SDtfs, 21099 SDslu, 53716 SDs, 0 SdLazy, 14096 SolverSat, 1001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 105 SyntacticMatches, 32 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred 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: 50.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 873676 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3374 NumberOfCodeBlocks, 3374 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3222 ConstructedInterpolants, 0 QuantifiedInterpolants, 814450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...