./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/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 b75e5b8cdb5de0dc84c69b534dde09e58e02f350 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:54:59,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 11:54:59,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 11:54:59,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 11:54:59,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 11:54:59,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 11:54:59,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 11:54:59,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 11:54:59,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 11:54:59,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 11:54:59,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 11:54:59,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 11:54:59,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 11:54:59,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 11:54:59,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 11:54:59,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 11:54:59,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 11:54:59,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 11:54:59,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 11:54:59,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 11:54:59,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 11:54:59,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 11:54:59,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 11:54:59,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 11:54:59,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 11:54:59,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 11:54:59,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 11:54:59,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 11:54:59,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 11:54:59,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 11:54:59,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 11:54:59,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 11:54:59,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 11:54:59,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 11:54:59,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 11:54:59,615 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 11:54:59,615 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 11:54:59,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 11:54:59,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 11:54:59,623 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 11:54:59,623 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 11:54:59,624 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 11:54:59,624 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 11:54:59,624 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 11:54:59,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 11:54:59,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 11:54:59,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 11:54:59,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 11:54:59,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 11:54:59,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 11:54:59,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 11:54:59,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 11:54:59,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 11:54:59,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 11:54:59,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 11:54:59,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 11:54:59,626 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 11:54:59,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 11:54:59,626 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_d4b644e6-6e0c-429d-8372-db053867b14e/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 -> b75e5b8cdb5de0dc84c69b534dde09e58e02f350 [2018-12-02 11:54:59,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 11:54:59,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 11:54:59,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 11:54:59,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 11:54:59,656 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 11:54:59,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i [2018-12-02 11:54:59,693 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/data/adc99f84d/d2d9402dc9604c798605bb20e15967db/FLAGbc4cccf31 [2018-12-02 11:55:00,086 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 11:55:00,086 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i [2018-12-02 11:55:00,094 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/data/adc99f84d/d2d9402dc9604c798605bb20e15967db/FLAGbc4cccf31 [2018-12-02 11:55:00,102 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/data/adc99f84d/d2d9402dc9604c798605bb20e15967db [2018-12-02 11:55:00,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 11:55:00,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 11:55:00,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 11:55:00,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 11:55:00,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 11:55:00,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00, skipping insertion in model container [2018-12-02 11:55:00,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 11:55:00,134 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 11:55:00,309 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:55:00,317 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 11:55:00,407 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:55:00,440 INFO L195 MainTranslator]: Completed translation [2018-12-02 11:55:00,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00 WrapperNode [2018-12-02 11:55:00,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 11:55:00,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 11:55:00,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 11:55:00,441 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 11:55:00,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 11:55:00,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 11:55:00,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 11:55:00,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 11:55:00,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... [2018-12-02 11:55:00,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 11:55:00,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 11:55:00,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 11:55:00,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 11:55:00,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/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 11:55:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 11:55:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 11:55:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 11:55:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 11:55:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 11:55:00,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 11:55:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 11:55:00,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 11:55:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 11:55:00,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 11:55:00,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 11:55:00,535 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 11:55:00,845 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 11:55:00,846 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 11:55:00,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:00 BoogieIcfgContainer [2018-12-02 11:55:00,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 11:55:00,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 11:55:00,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 11:55:00,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 11:55:00,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:55:00" (1/3) ... [2018-12-02 11:55:00,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f6139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:55:00, skipping insertion in model container [2018-12-02 11:55:00,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:00" (2/3) ... [2018-12-02 11:55:00,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f6139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:55:00, skipping insertion in model container [2018-12-02 11:55:00,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:00" (3/3) ... [2018-12-02 11:55:00,853 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt_false-unreach-call.i [2018-12-02 11:55:00,881 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,881 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,881 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,882 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:55:00,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 11:55:00,896 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 11:55:00,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 11:55:00,915 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 11:55:00,930 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 11:55:00,931 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 11:55:00,931 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 11:55:00,931 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 11:55:00,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 11:55:00,931 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 11:55:00,932 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 11:55:00,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 11:55:00,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 11:55:00,941 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 11:55:01,934 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2018-12-02 11:55:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2018-12-02 11:55:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 11:55:01,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:01,942 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] [2018-12-02 11:55:01,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:01,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2018-12-02 11:55:01,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:01,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:01,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:02,086 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 11:55:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:02,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:02,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:02,100 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2018-12-02 11:55:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:02,443 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2018-12-02 11:55:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:55:02,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 11:55:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:02,593 INFO L225 Difference]: With dead ends: 45388 [2018-12-02 11:55:02,593 INFO L226 Difference]: Without dead ends: 40628 [2018-12-02 11:55:02,594 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 11:55:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2018-12-02 11:55:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2018-12-02 11:55:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2018-12-02 11:55:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2018-12-02 11:55:03,332 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2018-12-02 11:55:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:03,333 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2018-12-02 11:55:03,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2018-12-02 11:55:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 11:55:03,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:03,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:55:03,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:03,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2018-12-02 11:55:03,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:03,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:03,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:03,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 11:55:03,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:55:03,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:55:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:55:03,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:03,403 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2018-12-02 11:55:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:04,033 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2018-12-02 11:55:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:55:04,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 11:55:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:04,227 INFO L225 Difference]: With dead ends: 64830 [2018-12-02 11:55:04,227 INFO L226 Difference]: Without dead ends: 64670 [2018-12-02 11:55:04,228 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 11:55:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2018-12-02 11:55:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2018-12-02 11:55:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2018-12-02 11:55:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2018-12-02 11:55:05,042 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2018-12-02 11:55:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:05,043 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2018-12-02 11:55:05,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:55:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2018-12-02 11:55:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 11:55:05,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:05,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:55:05,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:05,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2018-12-02 11:55:05,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:05,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:05,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:05,084 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 11:55:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:05,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:05,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:05,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:05,086 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2018-12-02 11:55:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:05,128 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2018-12-02 11:55:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:55:05,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 11:55:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:05,144 INFO L225 Difference]: With dead ends: 12364 [2018-12-02 11:55:05,144 INFO L226 Difference]: Without dead ends: 11843 [2018-12-02 11:55:05,145 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 11:55:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2018-12-02 11:55:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2018-12-02 11:55:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2018-12-02 11:55:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2018-12-02 11:55:05,286 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2018-12-02 11:55:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:05,286 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2018-12-02 11:55:05,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2018-12-02 11:55:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 11:55:05,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:05,289 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] [2018-12-02 11:55:05,289 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:05,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1535092985, now seen corresponding path program 1 times [2018-12-02 11:55:05,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:05,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:05,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:05,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:05,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:05,352 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 11:55:05,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:05,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:05,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:05,352 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2018-12-02 11:55:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:05,510 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2018-12-02 11:55:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:55:05,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 11:55:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:05,533 INFO L225 Difference]: With dead ends: 17019 [2018-12-02 11:55:05,533 INFO L226 Difference]: Without dead ends: 17019 [2018-12-02 11:55:05,533 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 11:55:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2018-12-02 11:55:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2018-12-02 11:55:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2018-12-02 11:55:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2018-12-02 11:55:05,748 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2018-12-02 11:55:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:05,748 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2018-12-02 11:55:05,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2018-12-02 11:55:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 11:55:05,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:05,754 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] [2018-12-02 11:55:05,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:05,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash -986044169, now seen corresponding path program 1 times [2018-12-02 11:55:05,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:05,820 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 11:55:05,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:05,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:55:05,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:55:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:55:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:55:05,821 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2018-12-02 11:55:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:06,218 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2018-12-02 11:55:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 11:55:06,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 11:55:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:06,242 INFO L225 Difference]: With dead ends: 18599 [2018-12-02 11:55:06,242 INFO L226 Difference]: Without dead ends: 18567 [2018-12-02 11:55:06,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 11:55:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2018-12-02 11:55:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2018-12-02 11:55:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2018-12-02 11:55:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2018-12-02 11:55:06,437 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2018-12-02 11:55:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:06,437 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2018-12-02 11:55:06,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:55:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2018-12-02 11:55:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 11:55:06,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:06,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:55:06,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:06,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2012561834, now seen corresponding path program 1 times [2018-12-02 11:55:06,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:06,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:06,521 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 11:55:06,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:06,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:06,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:06,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:06,522 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 4 states. [2018-12-02 11:55:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:06,788 INFO L93 Difference]: Finished difference Result 23159 states and 75002 transitions. [2018-12-02 11:55:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:55:06,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 11:55:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:06,819 INFO L225 Difference]: With dead ends: 23159 [2018-12-02 11:55:06,819 INFO L226 Difference]: Without dead ends: 22983 [2018-12-02 11:55:06,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22983 states. [2018-12-02 11:55:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22983 to 19511. [2018-12-02 11:55:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19511 states. [2018-12-02 11:55:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19511 states to 19511 states and 63974 transitions. [2018-12-02 11:55:07,075 INFO L78 Accepts]: Start accepts. Automaton has 19511 states and 63974 transitions. Word has length 72 [2018-12-02 11:55:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:07,076 INFO L480 AbstractCegarLoop]: Abstraction has 19511 states and 63974 transitions. [2018-12-02 11:55:07,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19511 states and 63974 transitions. [2018-12-02 11:55:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 11:55:07,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:07,089 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] [2018-12-02 11:55:07,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:07,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -659252137, now seen corresponding path program 1 times [2018-12-02 11:55:07,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:07,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:07,127 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 11:55:07,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:07,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:07,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:07,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:07,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:07,127 INFO L87 Difference]: Start difference. First operand 19511 states and 63974 transitions. Second operand 4 states. [2018-12-02 11:55:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:07,723 INFO L93 Difference]: Finished difference Result 27542 states and 88892 transitions. [2018-12-02 11:55:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:55:07,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 11:55:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:07,760 INFO L225 Difference]: With dead ends: 27542 [2018-12-02 11:55:07,760 INFO L226 Difference]: Without dead ends: 27542 [2018-12-02 11:55:07,760 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 11:55:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27542 states. [2018-12-02 11:55:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27542 to 24767. [2018-12-02 11:55:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24767 states. [2018-12-02 11:55:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24767 states to 24767 states and 80580 transitions. [2018-12-02 11:55:08,067 INFO L78 Accepts]: Start accepts. Automaton has 24767 states and 80580 transitions. Word has length 72 [2018-12-02 11:55:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:08,067 INFO L480 AbstractCegarLoop]: Abstraction has 24767 states and 80580 transitions. [2018-12-02 11:55:08,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24767 states and 80580 transitions. [2018-12-02 11:55:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 11:55:08,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:08,083 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] [2018-12-02 11:55:08,084 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:08,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash -594348726, now seen corresponding path program 1 times [2018-12-02 11:55:08,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:08,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:08,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:08,193 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 11:55:08,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:08,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 11:55:08,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 11:55:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 11:55:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:55:08,194 INFO L87 Difference]: Start difference. First operand 24767 states and 80580 transitions. Second operand 8 states. [2018-12-02 11:55:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:09,154 INFO L93 Difference]: Finished difference Result 37721 states and 118603 transitions. [2018-12-02 11:55:09,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 11:55:09,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-02 11:55:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:09,201 INFO L225 Difference]: With dead ends: 37721 [2018-12-02 11:55:09,201 INFO L226 Difference]: Without dead ends: 37473 [2018-12-02 11:55:09,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 11:55:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37473 states. [2018-12-02 11:55:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37473 to 27364. [2018-12-02 11:55:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27364 states. [2018-12-02 11:55:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27364 states to 27364 states and 88368 transitions. [2018-12-02 11:55:09,627 INFO L78 Accepts]: Start accepts. Automaton has 27364 states and 88368 transitions. Word has length 72 [2018-12-02 11:55:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:09,627 INFO L480 AbstractCegarLoop]: Abstraction has 27364 states and 88368 transitions. [2018-12-02 11:55:09,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 11:55:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 27364 states and 88368 transitions. [2018-12-02 11:55:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 11:55:09,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:09,650 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] [2018-12-02 11:55:09,650 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:09,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash -887751733, now seen corresponding path program 1 times [2018-12-02 11:55:09,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:09,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:09,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:09,726 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 11:55:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:55:09,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:55:09,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:55:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:55:09,727 INFO L87 Difference]: Start difference. First operand 27364 states and 88368 transitions. Second operand 6 states. [2018-12-02 11:55:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:09,993 INFO L93 Difference]: Finished difference Result 29954 states and 95614 transitions. [2018-12-02 11:55:09,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:55:09,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-02 11:55:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:10,042 INFO L225 Difference]: With dead ends: 29954 [2018-12-02 11:55:10,042 INFO L226 Difference]: Without dead ends: 29954 [2018-12-02 11:55:10,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:55:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29954 states. [2018-12-02 11:55:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29954 to 28147. [2018-12-02 11:55:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28147 states. [2018-12-02 11:55:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28147 states to 28147 states and 90561 transitions. [2018-12-02 11:55:10,473 INFO L78 Accepts]: Start accepts. Automaton has 28147 states and 90561 transitions. Word has length 72 [2018-12-02 11:55:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:10,473 INFO L480 AbstractCegarLoop]: Abstraction has 28147 states and 90561 transitions. [2018-12-02 11:55:10,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:55:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 28147 states and 90561 transitions. [2018-12-02 11:55:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 11:55:10,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:10,492 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] [2018-12-02 11:55:10,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:10,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 73862284, now seen corresponding path program 1 times [2018-12-02 11:55:10,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:10,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:10,527 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 11:55:10,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:10,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:55:10,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:55:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:55:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:10,528 INFO L87 Difference]: Start difference. First operand 28147 states and 90561 transitions. Second operand 5 states. [2018-12-02 11:55:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:10,558 INFO L93 Difference]: Finished difference Result 4691 states and 12177 transitions. [2018-12-02 11:55:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:55:10,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 11:55:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:10,562 INFO L225 Difference]: With dead ends: 4691 [2018-12-02 11:55:10,562 INFO L226 Difference]: Without dead ends: 3893 [2018-12-02 11:55:10,562 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 11:55:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2018-12-02 11:55:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3596. [2018-12-02 11:55:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3596 states. [2018-12-02 11:55:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 9379 transitions. [2018-12-02 11:55:10,590 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 9379 transitions. Word has length 72 [2018-12-02 11:55:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:10,590 INFO L480 AbstractCegarLoop]: Abstraction has 3596 states and 9379 transitions. [2018-12-02 11:55:10,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:55:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 9379 transitions. [2018-12-02 11:55:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:55:10,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:10,593 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] [2018-12-02 11:55:10,593 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:10,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1448429930, now seen corresponding path program 1 times [2018-12-02 11:55:10,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:10,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:10,638 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 11:55:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:55:10,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:55:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:55:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:10,639 INFO L87 Difference]: Start difference. First operand 3596 states and 9379 transitions. Second operand 5 states. [2018-12-02 11:55:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:10,734 INFO L93 Difference]: Finished difference Result 3926 states and 10118 transitions. [2018-12-02 11:55:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:55:10,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 11:55:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:10,737 INFO L225 Difference]: With dead ends: 3926 [2018-12-02 11:55:10,737 INFO L226 Difference]: Without dead ends: 3926 [2018-12-02 11:55:10,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2018-12-02 11:55:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3634. [2018-12-02 11:55:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-12-02 11:55:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 9483 transitions. [2018-12-02 11:55:10,763 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 9483 transitions. Word has length 91 [2018-12-02 11:55:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:10,763 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 9483 transitions. [2018-12-02 11:55:10,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:55:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 9483 transitions. [2018-12-02 11:55:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:55:10,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:10,766 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] [2018-12-02 11:55:10,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:10,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:10,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1136407171, now seen corresponding path program 1 times [2018-12-02 11:55:10,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:10,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 11:55:10,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:10,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:10,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:10,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:10,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:10,799 INFO L87 Difference]: Start difference. First operand 3634 states and 9483 transitions. Second operand 4 states. [2018-12-02 11:55:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:10,874 INFO L93 Difference]: Finished difference Result 4252 states and 10932 transitions. [2018-12-02 11:55:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:55:10,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 11:55:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:10,878 INFO L225 Difference]: With dead ends: 4252 [2018-12-02 11:55:10,878 INFO L226 Difference]: Without dead ends: 4224 [2018-12-02 11:55:10,878 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 11:55:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2018-12-02 11:55:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 4156. [2018-12-02 11:55:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4156 states. [2018-12-02 11:55:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 10728 transitions. [2018-12-02 11:55:10,907 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 10728 transitions. Word has length 91 [2018-12-02 11:55:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:10,907 INFO L480 AbstractCegarLoop]: Abstraction has 4156 states and 10728 transitions. [2018-12-02 11:55:10,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 10728 transitions. [2018-12-02 11:55:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:55:10,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:10,910 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] [2018-12-02 11:55:10,910 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:10,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2105988194, now seen corresponding path program 1 times [2018-12-02 11:55:10,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:10,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:10,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:10,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:10,945 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 11:55:10,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:10,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:55:10,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:55:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:55:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:10,946 INFO L87 Difference]: Start difference. First operand 4156 states and 10728 transitions. Second operand 4 states. [2018-12-02 11:55:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:11,074 INFO L93 Difference]: Finished difference Result 5141 states and 13366 transitions. [2018-12-02 11:55:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:55:11,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 11:55:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:11,078 INFO L225 Difference]: With dead ends: 5141 [2018-12-02 11:55:11,078 INFO L226 Difference]: Without dead ends: 5141 [2018-12-02 11:55:11,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:55:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2018-12-02 11:55:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4021. [2018-12-02 11:55:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2018-12-02 11:55:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 10331 transitions. [2018-12-02 11:55:11,112 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 10331 transitions. Word has length 91 [2018-12-02 11:55:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:11,112 INFO L480 AbstractCegarLoop]: Abstraction has 4021 states and 10331 transitions. [2018-12-02 11:55:11,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:55:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 10331 transitions. [2018-12-02 11:55:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:55:11,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:11,115 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] [2018-12-02 11:55:11,115 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:11,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1370145268, now seen corresponding path program 2 times [2018-12-02 11:55:11,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:11,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:11,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:11,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:11,170 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 11:55:11,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:11,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:55:11,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:55:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:55:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:11,171 INFO L87 Difference]: Start difference. First operand 4021 states and 10331 transitions. Second operand 5 states. [2018-12-02 11:55:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:11,299 INFO L93 Difference]: Finished difference Result 4493 states and 11451 transitions. [2018-12-02 11:55:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:55:11,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 11:55:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:11,302 INFO L225 Difference]: With dead ends: 4493 [2018-12-02 11:55:11,302 INFO L226 Difference]: Without dead ends: 4465 [2018-12-02 11:55:11,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:55:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-12-02 11:55:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3983. [2018-12-02 11:55:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2018-12-02 11:55:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 10225 transitions. [2018-12-02 11:55:11,334 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 10225 transitions. Word has length 91 [2018-12-02 11:55:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:11,334 INFO L480 AbstractCegarLoop]: Abstraction has 3983 states and 10225 transitions. [2018-12-02 11:55:11,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:55:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 10225 transitions. [2018-12-02 11:55:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:55:11,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:11,337 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] [2018-12-02 11:55:11,337 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:11,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1439443098, now seen corresponding path program 1 times [2018-12-02 11:55:11,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:55:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:11,403 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 11:55:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:55:11,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:55:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:55:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:55:11,404 INFO L87 Difference]: Start difference. First operand 3983 states and 10225 transitions. Second operand 6 states. [2018-12-02 11:55:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:11,615 INFO L93 Difference]: Finished difference Result 4367 states and 10977 transitions. [2018-12-02 11:55:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:55:11,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 11:55:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:11,618 INFO L225 Difference]: With dead ends: 4367 [2018-12-02 11:55:11,618 INFO L226 Difference]: Without dead ends: 4242 [2018-12-02 11:55:11,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 11:55:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4242 states. [2018-12-02 11:55:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4242 to 4149. [2018-12-02 11:55:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2018-12-02 11:55:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 10564 transitions. [2018-12-02 11:55:11,645 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 10564 transitions. Word has length 93 [2018-12-02 11:55:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:11,645 INFO L480 AbstractCegarLoop]: Abstraction has 4149 states and 10564 transitions. [2018-12-02 11:55:11,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:55:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 10564 transitions. [2018-12-02 11:55:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:55:11,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:11,648 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] [2018-12-02 11:55:11,648 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:11,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 261297381, now seen corresponding path program 1 times [2018-12-02 11:55:11,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:11,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:11,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:11,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:11,716 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 11:55:11,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:11,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:55:11,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:55:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:55:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:55:11,717 INFO L87 Difference]: Start difference. First operand 4149 states and 10564 transitions. Second operand 7 states. [2018-12-02 11:55:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:11,951 INFO L93 Difference]: Finished difference Result 4483 states and 11383 transitions. [2018-12-02 11:55:11,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:55:11,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 11:55:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:11,954 INFO L225 Difference]: With dead ends: 4483 [2018-12-02 11:55:11,954 INFO L226 Difference]: Without dead ends: 4483 [2018-12-02 11:55:11,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:55:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2018-12-02 11:55:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 4141. [2018-12-02 11:55:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2018-12-02 11:55:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 10552 transitions. [2018-12-02 11:55:11,983 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 10552 transitions. Word has length 93 [2018-12-02 11:55:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:11,984 INFO L480 AbstractCegarLoop]: Abstraction has 4141 states and 10552 transitions. [2018-12-02 11:55:11,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:55:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 10552 transitions. [2018-12-02 11:55:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:55:11,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:11,987 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] [2018-12-02 11:55:11,987 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:11,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1672176901, now seen corresponding path program 1 times [2018-12-02 11:55:11,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:11,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:12,041 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 11:55:12,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:12,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:55:12,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:55:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:55:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:55:12,042 INFO L87 Difference]: Start difference. First operand 4141 states and 10552 transitions. Second operand 5 states. [2018-12-02 11:55:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:12,137 INFO L93 Difference]: Finished difference Result 3573 states and 9086 transitions. [2018-12-02 11:55:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:55:12,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 11:55:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:12,139 INFO L225 Difference]: With dead ends: 3573 [2018-12-02 11:55:12,140 INFO L226 Difference]: Without dead ends: 3573 [2018-12-02 11:55:12,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:55:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2018-12-02 11:55:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3476. [2018-12-02 11:55:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2018-12-02 11:55:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 8885 transitions. [2018-12-02 11:55:12,165 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 8885 transitions. Word has length 93 [2018-12-02 11:55:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:12,165 INFO L480 AbstractCegarLoop]: Abstraction has 3476 states and 8885 transitions. [2018-12-02 11:55:12,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:55:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 8885 transitions. [2018-12-02 11:55:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:55:12,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:12,168 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] [2018-12-02 11:55:12,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:12,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1223480262, now seen corresponding path program 1 times [2018-12-02 11:55:12,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:12,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:12,225 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 11:55:12,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:12,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:55:12,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:55:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:55:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:55:12,226 INFO L87 Difference]: Start difference. First operand 3476 states and 8885 transitions. Second operand 6 states. [2018-12-02 11:55:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:12,277 INFO L93 Difference]: Finished difference Result 3236 states and 8109 transitions. [2018-12-02 11:55:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:55:12,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 11:55:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:12,279 INFO L225 Difference]: With dead ends: 3236 [2018-12-02 11:55:12,279 INFO L226 Difference]: Without dead ends: 3236 [2018-12-02 11:55:12,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:55:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-12-02 11:55:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 2830. [2018-12-02 11:55:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2018-12-02 11:55:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7147 transitions. [2018-12-02 11:55:12,298 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7147 transitions. Word has length 93 [2018-12-02 11:55:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:12,298 INFO L480 AbstractCegarLoop]: Abstraction has 2830 states and 7147 transitions. [2018-12-02 11:55:12,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:55:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7147 transitions. [2018-12-02 11:55:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:12,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:12,300 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] [2018-12-02 11:55:12,300 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:12,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 88998062, now seen corresponding path program 1 times [2018-12-02 11:55:12,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:12,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:12,340 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 11:55:12,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:12,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:55:12,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:55:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:55:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:55:12,340 INFO L87 Difference]: Start difference. First operand 2830 states and 7147 transitions. Second operand 7 states. [2018-12-02 11:55:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:12,695 INFO L93 Difference]: Finished difference Result 4468 states and 11024 transitions. [2018-12-02 11:55:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 11:55:12,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 11:55:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:12,698 INFO L225 Difference]: With dead ends: 4468 [2018-12-02 11:55:12,698 INFO L226 Difference]: Without dead ends: 4468 [2018-12-02 11:55:12,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 11:55:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2018-12-02 11:55:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3196. [2018-12-02 11:55:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2018-12-02 11:55:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 8035 transitions. [2018-12-02 11:55:12,727 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 8035 transitions. Word has length 95 [2018-12-02 11:55:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:12,727 INFO L480 AbstractCegarLoop]: Abstraction has 3196 states and 8035 transitions. [2018-12-02 11:55:12,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:55:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 8035 transitions. [2018-12-02 11:55:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:12,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:12,729 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] [2018-12-02 11:55:12,729 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:12,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1333762543, now seen corresponding path program 1 times [2018-12-02 11:55:12,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:12,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:55:12,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:12,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:55:12,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:55:12,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:55:12,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:55:12,779 INFO L87 Difference]: Start difference. First operand 3196 states and 8035 transitions. Second operand 6 states. [2018-12-02 11:55:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:12,865 INFO L93 Difference]: Finished difference Result 3326 states and 8246 transitions. [2018-12-02 11:55:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 11:55:12,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 11:55:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:12,868 INFO L225 Difference]: With dead ends: 3326 [2018-12-02 11:55:12,868 INFO L226 Difference]: Without dead ends: 3326 [2018-12-02 11:55:12,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 11:55:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2018-12-02 11:55:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3196. [2018-12-02 11:55:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2018-12-02 11:55:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 8000 transitions. [2018-12-02 11:55:12,891 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 8000 transitions. Word has length 95 [2018-12-02 11:55:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:12,891 INFO L480 AbstractCegarLoop]: Abstraction has 3196 states and 8000 transitions. [2018-12-02 11:55:12,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:55:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 8000 transitions. [2018-12-02 11:55:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:12,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:12,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] [2018-12-02 11:55:12,894 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:12,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1457835790, now seen corresponding path program 1 times [2018-12-02 11:55:12,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:12,954 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 11:55:12,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:12,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 11:55:12,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 11:55:12,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 11:55:12,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 11:55:12,956 INFO L87 Difference]: Start difference. First operand 3196 states and 8000 transitions. Second operand 9 states. [2018-12-02 11:55:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:13,252 INFO L93 Difference]: Finished difference Result 4106 states and 10121 transitions. [2018-12-02 11:55:13,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 11:55:13,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 11:55:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:13,255 INFO L225 Difference]: With dead ends: 4106 [2018-12-02 11:55:13,255 INFO L226 Difference]: Without dead ends: 4106 [2018-12-02 11:55:13,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-12-02 11:55:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-02 11:55:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3265. [2018-12-02 11:55:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2018-12-02 11:55:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 8138 transitions. [2018-12-02 11:55:13,280 INFO L78 Accepts]: Start accepts. Automaton has 3265 states and 8138 transitions. Word has length 95 [2018-12-02 11:55:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:13,280 INFO L480 AbstractCegarLoop]: Abstraction has 3265 states and 8138 transitions. [2018-12-02 11:55:13,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 11:55:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 8138 transitions. [2018-12-02 11:55:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:13,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:13,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:55:13,283 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:13,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1845875308, now seen corresponding path program 1 times [2018-12-02 11:55:13,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:13,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:13,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:13,362 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 11:55:13,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:13,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 11:55:13,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 11:55:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 11:55:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:55:13,363 INFO L87 Difference]: Start difference. First operand 3265 states and 8138 transitions. Second operand 8 states. [2018-12-02 11:55:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:13,702 INFO L93 Difference]: Finished difference Result 5130 states and 12996 transitions. [2018-12-02 11:55:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 11:55:13,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-02 11:55:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:13,706 INFO L225 Difference]: With dead ends: 5130 [2018-12-02 11:55:13,706 INFO L226 Difference]: Without dead ends: 5098 [2018-12-02 11:55:13,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-02 11:55:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2018-12-02 11:55:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4629. [2018-12-02 11:55:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4629 states. [2018-12-02 11:55:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 11758 transitions. [2018-12-02 11:55:13,743 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 11758 transitions. Word has length 95 [2018-12-02 11:55:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:13,743 INFO L480 AbstractCegarLoop]: Abstraction has 4629 states and 11758 transitions. [2018-12-02 11:55:13,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 11:55:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 11758 transitions. [2018-12-02 11:55:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:13,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:13,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] [2018-12-02 11:55:13,747 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:13,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1204327507, now seen corresponding path program 1 times [2018-12-02 11:55:13,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:13,828 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 11:55:13,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:13,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:55:13,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:55:13,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:55:13,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:55:13,829 INFO L87 Difference]: Start difference. First operand 4629 states and 11758 transitions. Second operand 7 states. [2018-12-02 11:55:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:13,986 INFO L93 Difference]: Finished difference Result 7602 states and 19602 transitions. [2018-12-02 11:55:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:55:13,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 11:55:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:13,988 INFO L225 Difference]: With dead ends: 7602 [2018-12-02 11:55:13,988 INFO L226 Difference]: Without dead ends: 3053 [2018-12-02 11:55:13,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 11:55:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2018-12-02 11:55:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2018-12-02 11:55:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2018-12-02 11:55:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 7982 transitions. [2018-12-02 11:55:14,010 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 7982 transitions. Word has length 95 [2018-12-02 11:55:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:14,010 INFO L480 AbstractCegarLoop]: Abstraction has 3053 states and 7982 transitions. [2018-12-02 11:55:14,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:55:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 7982 transitions. [2018-12-02 11:55:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:14,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:14,013 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] [2018-12-02 11:55:14,013 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:14,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -827369038, now seen corresponding path program 1 times [2018-12-02 11:55:14,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:14,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:14,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:55:14,091 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 11:55:14,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:55:14,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:55:14,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:55:14,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:55:14,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:55:14,091 INFO L87 Difference]: Start difference. First operand 3053 states and 7982 transitions. Second operand 7 states. [2018-12-02 11:55:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:55:14,283 INFO L93 Difference]: Finished difference Result 3131 states and 8117 transitions. [2018-12-02 11:55:14,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 11:55:14,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 11:55:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:55:14,286 INFO L225 Difference]: With dead ends: 3131 [2018-12-02 11:55:14,286 INFO L226 Difference]: Without dead ends: 3100 [2018-12-02 11:55:14,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 11:55:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-02 11:55:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3039. [2018-12-02 11:55:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3039 states. [2018-12-02 11:55:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 7948 transitions. [2018-12-02 11:55:14,307 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 7948 transitions. Word has length 95 [2018-12-02 11:55:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:55:14,307 INFO L480 AbstractCegarLoop]: Abstraction has 3039 states and 7948 transitions. [2018-12-02 11:55:14,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:55:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 7948 transitions. [2018-12-02 11:55:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 11:55:14,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:55:14,310 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] [2018-12-02 11:55:14,310 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:55:14,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:55:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2010716335, now seen corresponding path program 2 times [2018-12-02 11:55:14,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 11:55:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 11:55:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:14,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:55:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:55:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:55:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:55:14,348 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 11:55:14,411 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 11:55:14,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:55:14 BasicIcfg [2018-12-02 11:55:14,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 11:55:14,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 11:55:14,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 11:55:14,413 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 11:55:14,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:00" (3/4) ... [2018-12-02 11:55:14,415 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 11:55:14,483 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d4b644e6-6e0c-429d-8372-db053867b14e/bin-2019/uautomizer/witness.graphml [2018-12-02 11:55:14,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 11:55:14,484 INFO L168 Benchmark]: Toolchain (without parser) took 14379.31 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 956.0 MB in the beginning and 1.6 GB in the end (delta: -685.1 MB). Peak memory consumption was 903.5 MB. Max. memory is 11.5 GB. [2018-12-02 11:55:14,485 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:55:14,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-02 11:55:14,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 11:55:14,485 INFO L168 Benchmark]: Boogie Preprocessor took 21.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:55:14,485 INFO L168 Benchmark]: RCFGBuilder took 348.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2018-12-02 11:55:14,486 INFO L168 Benchmark]: TraceAbstraction took 13565.49 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -590.9 MB). Peak memory consumption was 838.8 MB. Max. memory is 11.5 GB. [2018-12-02 11:55:14,486 INFO L168 Benchmark]: Witness Printer took 70.41 ms. Allocated memory is still 2.6 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-12-02 11:55:14,488 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 348.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13565.49 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -590.9 MB). Peak memory consumption was 838.8 MB. Max. memory is 11.5 GB. * Witness Printer took 70.41 ms. Allocated memory is still 2.6 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] -1 pthread_t t1597; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] FCALL, FORK -1 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] -1 pthread_t t1598; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] FCALL, FORK -1 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 y = 1 [L735] 0 __unbuffered_p1_EAX = y [L738] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L701] 1 y = 2 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L742] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L773] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L779] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L780] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L781] -1 x$flush_delayed = weak$$choice2 [L782] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L784] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L785] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L786] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L788] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L789] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] -1 x = x$flush_delayed ? x$mem_tmp : x [L792] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 180 locations, 3 error locations. UNSAFE Result, 13.4s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5776 SDtfs, 5042 SDslu, 12673 SDs, 0 SdLazy, 6715 SolverSat, 342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 64 SyntacticMatches, 18 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37142occurred in iteration=2, 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: 3.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 76923 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2003 NumberOfCodeBlocks, 2003 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1884 ConstructedInterpolants, 0 QuantifiedInterpolants, 400169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...