./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_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_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8532975007e7de57cf2396d5819c62a5d616988c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 04:13:28,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:13:28,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:13:28,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:13:28,782 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:13:28,783 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:13:28,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:13:28,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:13:28,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:13:28,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:13:28,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:13:28,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:13:28,788 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:13:28,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:13:28,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:13:28,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:13:28,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:13:28,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:13:28,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:13:28,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:13:28,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:13:28,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:13:28,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:13:28,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:13:28,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:13:28,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:13:28,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:13:28,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:13:28,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:13:28,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:13:28,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:13:28,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:13:28,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:13:28,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:13:28,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:13:28,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:13:28,802 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 04:13:28,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:13:28,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:13:28,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:13:28,814 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:13:28,814 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:13:28,815 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:13:28,815 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:13:28,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:13:28,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:13:28,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:13:28,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:13:28,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:13:28,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:13:28,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 04:13:28,817 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan 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 -> Taipan 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 -> 8532975007e7de57cf2396d5819c62a5d616988c [2018-12-09 04:13:28,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:13:28,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:13:28,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:13:28,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:13:28,853 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:13:28,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix048_rmo.opt_false-unreach-call.i [2018-12-09 04:13:28,897 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/data/b76383586/c8777b1bc838412fbb945886d74c854b/FLAG6fc75fdd8 [2018-12-09 04:13:29,269 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:13:29,270 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/sv-benchmarks/c/pthread-wmm/mix048_rmo.opt_false-unreach-call.i [2018-12-09 04:13:29,276 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/data/b76383586/c8777b1bc838412fbb945886d74c854b/FLAG6fc75fdd8 [2018-12-09 04:13:29,634 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/data/b76383586/c8777b1bc838412fbb945886d74c854b [2018-12-09 04:13:29,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:13:29,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:13:29,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:13:29,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:13:29,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:13:29,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:29,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29, skipping insertion in model container [2018-12-09 04:13:29,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:29,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:13:29,675 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:13:29,863 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:13:29,870 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:13:29,943 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:13:29,972 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:13:29,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29 WrapperNode [2018-12-09 04:13:29,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:13:29,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:13:29,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:13:29,973 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:13:29,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:29,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:13:30,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:13:30,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:13:30,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:13:30,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... [2018-12-09 04:13:30,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:13:30,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:13:30,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:13:30,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:13:30,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/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-09 04:13:30,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:13:30,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:13:30,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 04:13:30,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:13:30,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 04:13:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 04:13:30,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 04:13:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 04:13:30,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 04:13:30,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:13:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:13:30,059 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 04:13:30,371 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:13:30,372 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 04:13:30,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:13:30 BoogieIcfgContainer [2018-12-09 04:13:30,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:13:30,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:13:30,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:13:30,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:13:30,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:13:29" (1/3) ... [2018-12-09 04:13:30,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b1c352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:13:30, skipping insertion in model container [2018-12-09 04:13:30,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:29" (2/3) ... [2018-12-09 04:13:30,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b1c352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:13:30, skipping insertion in model container [2018-12-09 04:13:30,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:13:30" (3/3) ... [2018-12-09 04:13:30,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_rmo.opt_false-unreach-call.i [2018-12-09 04:13:30,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,403 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:13:30,417 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 04:13:30,418 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:13:30,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 04:13:30,432 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 04:13:30,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:13:30,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:13:30,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:13:30,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:13:30,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:13:30,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:13:30,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:13:30,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:13:30,454 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-09 04:13:32,058 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-09 04:13:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-09 04:13:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 04:13:32,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:32,065 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] [2018-12-09 04:13:32,067 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:32,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-09 04:13:32,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:32,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:32,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:32,208 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-09 04:13:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:32,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:32,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:32,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:32,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:32,223 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-09 04:13:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:32,737 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-09 04:13:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:32,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 04:13:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:32,875 INFO L225 Difference]: With dead ends: 60790 [2018-12-09 04:13:32,875 INFO L226 Difference]: Without dead ends: 44270 [2018-12-09 04:13:32,876 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-09 04:13:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-09 04:13:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-09 04:13:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-09 04:13:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-09 04:13:33,646 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-09 04:13:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:33,646 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-09 04:13:33,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-09 04:13:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 04:13:33,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:33,651 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-09 04:13:33,651 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:33,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-09 04:13:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:33,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:33,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:33,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:33,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:33,703 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-09 04:13:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:33,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:33,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:33,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:33,705 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-09 04:13:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:33,792 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-09 04:13:33,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:13:33,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 04:13:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:33,817 INFO L225 Difference]: With dead ends: 8528 [2018-12-09 04:13:33,817 INFO L226 Difference]: Without dead ends: 7466 [2018-12-09 04:13:33,818 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-09 04:13:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-09 04:13:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-09 04:13:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-09 04:13:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-09 04:13:33,922 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-09 04:13:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:33,922 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-09 04:13:33,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-09 04:13:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 04:13:33,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:33,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:33,924 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:33,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-09 04:13:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:33,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:33,966 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-09 04:13:33,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:33,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:33,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:33,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:33,966 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-09 04:13:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:34,176 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-09 04:13:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:34,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 04:13:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:34,205 INFO L225 Difference]: With dead ends: 13998 [2018-12-09 04:13:34,205 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 04:13:34,205 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-09 04:13:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 04:13:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-09 04:13:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-09 04:13:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-09 04:13:34,441 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-09 04:13:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:34,442 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-09 04:13:34,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-09 04:13:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 04:13:34,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:34,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:34,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:34,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-09 04:13:34,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:34,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:34,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:34,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:34,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:34,483 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-09 04:13:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:34,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:13:34,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:34,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:34,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:34,484 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-09 04:13:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:34,536 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-09 04:13:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:34,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 04:13:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:34,554 INFO L225 Difference]: With dead ends: 13279 [2018-12-09 04:13:34,554 INFO L226 Difference]: Without dead ends: 13279 [2018-12-09 04:13:34,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-09 04:13:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-09 04:13:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-09 04:13:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-09 04:13:34,675 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-09 04:13:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:34,675 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-09 04:13:34,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-09 04:13:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:13:34,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:34,677 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] [2018-12-09 04:13:34,677 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:34,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-09 04:13:34,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:34,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:34,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:34,730 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-09 04:13:34,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:13:34,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:34,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:13:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:13:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:34,731 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-09 04:13:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:35,125 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-09 04:13:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:13:35,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-09 04:13:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:35,138 INFO L225 Difference]: With dead ends: 12285 [2018-12-09 04:13:35,138 INFO L226 Difference]: Without dead ends: 12213 [2018-12-09 04:13:35,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:13:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-09 04:13:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-09 04:13:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-09 04:13:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-09 04:13:35,255 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-09 04:13:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:35,255 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-09 04:13:35,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:13:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-09 04:13:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:13:35,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:35,259 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] [2018-12-09 04:13:35,260 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:35,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-09 04:13:35,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:35,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:35,320 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-09 04:13:35,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:35,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:35,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:35,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:35,321 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-09 04:13:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:35,395 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-09 04:13:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:13:35,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 04:13:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:35,410 INFO L225 Difference]: With dead ends: 12396 [2018-12-09 04:13:35,410 INFO L226 Difference]: Without dead ends: 12396 [2018-12-09 04:13:35,410 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-09 04:13:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-09 04:13:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-09 04:13:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-09 04:13:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-09 04:13:35,553 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-09 04:13:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:35,553 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-09 04:13:35,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-09 04:13:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:13:35,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:35,557 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] [2018-12-09 04:13:35,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-09 04:13:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:35,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:35,607 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-09 04:13:35,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:35,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:35,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:35,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:35,608 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-09 04:13:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:35,963 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-09 04:13:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:13:35,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-09 04:13:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:35,989 INFO L225 Difference]: With dead ends: 20969 [2018-12-09 04:13:35,989 INFO L226 Difference]: Without dead ends: 20898 [2018-12-09 04:13:35,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:13:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-09 04:13:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-09 04:13:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-09 04:13:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-09 04:13:36,165 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-09 04:13:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:36,165 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-09 04:13:36,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-09 04:13:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 04:13:36,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:36,170 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] [2018-12-09 04:13:36,170 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:36,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-12-09 04:13:36,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:36,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:36,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:36,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:36,211 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-09 04:13:36,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:36,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:36,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:36,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:36,212 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-09 04:13:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:36,397 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-09 04:13:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:36,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 04:13:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:36,416 INFO L225 Difference]: With dead ends: 17635 [2018-12-09 04:13:36,416 INFO L226 Difference]: Without dead ends: 17635 [2018-12-09 04:13:36,417 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-09 04:13:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-09 04:13:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-09 04:13:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-09 04:13:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-09 04:13:36,594 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-09 04:13:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:36,594 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-09 04:13:36,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-09 04:13:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 04:13:36,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:36,599 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] [2018-12-09 04:13:36,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:36,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:36,599 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-12-09 04:13:36,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:36,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:36,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:36,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:36,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:36,632 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-09 04:13:36,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:36,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:13:36,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:36,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:36,633 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-09 04:13:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:36,765 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-09 04:13:36,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:36,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-09 04:13:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:36,785 INFO L225 Difference]: With dead ends: 16385 [2018-12-09 04:13:36,785 INFO L226 Difference]: Without dead ends: 16385 [2018-12-09 04:13:36,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-09 04:13:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-09 04:13:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-09 04:13:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-09 04:13:36,958 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-09 04:13:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:36,958 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-09 04:13:36,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-09 04:13:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:36,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:36,965 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] [2018-12-09 04:13:36,965 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:36,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-12-09 04:13:36,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:36,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:36,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:36,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:36,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:37,042 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-09 04:13:37,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:37,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:37,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:37,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:37,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:37,043 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-09 04:13:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:37,686 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-09 04:13:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:37,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 04:13:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:37,706 INFO L225 Difference]: With dead ends: 19821 [2018-12-09 04:13:37,706 INFO L226 Difference]: Without dead ends: 19821 [2018-12-09 04:13:37,706 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-09 04:13:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-09 04:13:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-09 04:13:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-09 04:13:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-09 04:13:37,904 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-09 04:13:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:37,904 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-09 04:13:37,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-09 04:13:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:37,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:37,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:37,911 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:37,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-12-09 04:13:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:37,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:37,978 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-09 04:13:37,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:37,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:37,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:37,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:37,978 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-09 04:13:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:38,250 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-09 04:13:38,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:13:38,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 04:13:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:38,272 INFO L225 Difference]: With dead ends: 21449 [2018-12-09 04:13:38,272 INFO L226 Difference]: Without dead ends: 21449 [2018-12-09 04:13:38,272 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-09 04:13:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-09 04:13:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-09 04:13:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-09 04:13:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-09 04:13:38,477 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-09 04:13:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:38,477 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-09 04:13:38,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-09 04:13:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:38,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:38,484 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] [2018-12-09 04:13:38,484 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:38,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-12-09 04:13:38,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:38,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:38,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:38,539 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-09 04:13:38,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:38,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:38,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:38,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:38,540 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-09 04:13:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:38,784 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-09 04:13:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:38,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:13:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:38,813 INFO L225 Difference]: With dead ends: 25024 [2018-12-09 04:13:38,813 INFO L226 Difference]: Without dead ends: 25024 [2018-12-09 04:13:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-09 04:13:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-09 04:13:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-09 04:13:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-09 04:13:39,077 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-09 04:13:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:39,077 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-09 04:13:39,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-09 04:13:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:39,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:39,085 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] [2018-12-09 04:13:39,085 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:39,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-12-09 04:13:39,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:39,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:39,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:13:39,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:39,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:39,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:39,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:39,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:39,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:39,123 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-12-09 04:13:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:39,485 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-12-09 04:13:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:13:39,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 04:13:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:39,525 INFO L225 Difference]: With dead ends: 31689 [2018-12-09 04:13:39,525 INFO L226 Difference]: Without dead ends: 31537 [2018-12-09 04:13:39,526 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-09 04:13:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-12-09 04:13:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-12-09 04:13:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-12-09 04:13:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-12-09 04:13:39,926 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-12-09 04:13:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:39,926 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-12-09 04:13:39,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-12-09 04:13:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:39,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:39,936 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] [2018-12-09 04:13:39,936 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:39,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1369694566, now seen corresponding path program 1 times [2018-12-09 04:13:39,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:39,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:39,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:13:39,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:39,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:39,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:39,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:39,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:39,973 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-12-09 04:13:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:40,289 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-12-09 04:13:40,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:13:40,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:13:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:40,338 INFO L225 Difference]: With dead ends: 40195 [2018-12-09 04:13:40,338 INFO L226 Difference]: Without dead ends: 39987 [2018-12-09 04:13:40,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:13:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-12-09 04:13:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-12-09 04:13:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-09 04:13:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-09 04:13:40,750 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-09 04:13:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:40,750 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-09 04:13:40,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-09 04:13:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:40,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:40,759 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] [2018-12-09 04:13:40,760 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:40,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2060256040, now seen corresponding path program 1 times [2018-12-09 04:13:40,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:40,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:40,802 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-09 04:13:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:40,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:40,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:40,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:40,804 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 5 states. [2018-12-09 04:13:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:40,841 INFO L93 Difference]: Finished difference Result 9315 states and 22546 transitions. [2018-12-09 04:13:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:40,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:13:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:40,846 INFO L225 Difference]: With dead ends: 9315 [2018-12-09 04:13:40,846 INFO L226 Difference]: Without dead ends: 7463 [2018-12-09 04:13:40,847 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-09 04:13:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2018-12-09 04:13:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6360. [2018-12-09 04:13:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6360 states. [2018-12-09 04:13:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 15017 transitions. [2018-12-09 04:13:40,898 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 15017 transitions. Word has length 66 [2018-12-09 04:13:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:40,898 INFO L480 AbstractCegarLoop]: Abstraction has 6360 states and 15017 transitions. [2018-12-09 04:13:40,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 15017 transitions. [2018-12-09 04:13:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:13:40,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:40,902 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] [2018-12-09 04:13:40,902 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:40,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-09 04:13:40,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:40,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:40,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:40,927 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-09 04:13:40,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:40,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:13:40,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:40,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:40,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:40,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:40,928 INFO L87 Difference]: Start difference. First operand 6360 states and 15017 transitions. Second operand 3 states. [2018-12-09 04:13:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:40,957 INFO L93 Difference]: Finished difference Result 8819 states and 20756 transitions. [2018-12-09 04:13:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:40,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 04:13:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:40,963 INFO L225 Difference]: With dead ends: 8819 [2018-12-09 04:13:40,963 INFO L226 Difference]: Without dead ends: 8819 [2018-12-09 04:13:40,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8819 states. [2018-12-09 04:13:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8819 to 6299. [2018-12-09 04:13:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2018-12-09 04:13:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 14557 transitions. [2018-12-09 04:13:41,018 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 14557 transitions. Word has length 66 [2018-12-09 04:13:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:41,018 INFO L480 AbstractCegarLoop]: Abstraction has 6299 states and 14557 transitions. [2018-12-09 04:13:41,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 14557 transitions. [2018-12-09 04:13:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:13:41,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:41,022 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-09 04:13:41,022 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:41,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-09 04:13:41,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:41,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:41,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:41,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:41,071 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-09 04:13:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:41,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:41,072 INFO L87 Difference]: Start difference. First operand 6299 states and 14557 transitions. Second operand 5 states. [2018-12-09 04:13:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:41,177 INFO L93 Difference]: Finished difference Result 7469 states and 17198 transitions. [2018-12-09 04:13:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:13:41,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-09 04:13:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:41,185 INFO L225 Difference]: With dead ends: 7469 [2018-12-09 04:13:41,185 INFO L226 Difference]: Without dead ends: 7469 [2018-12-09 04:13:41,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:13:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-09 04:13:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6743. [2018-12-09 04:13:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6743 states. [2018-12-09 04:13:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6743 states to 6743 states and 15561 transitions. [2018-12-09 04:13:41,244 INFO L78 Accepts]: Start accepts. Automaton has 6743 states and 15561 transitions. Word has length 72 [2018-12-09 04:13:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:41,244 INFO L480 AbstractCegarLoop]: Abstraction has 6743 states and 15561 transitions. [2018-12-09 04:13:41,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6743 states and 15561 transitions. [2018-12-09 04:13:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:13:41,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:41,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:13:41,249 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:41,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-09 04:13:41,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:41,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:41,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:41,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:41,341 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-09 04:13:41,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:41,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:13:41,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:41,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:13:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:13:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:13:41,342 INFO L87 Difference]: Start difference. First operand 6743 states and 15561 transitions. Second operand 9 states. [2018-12-09 04:13:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:41,677 INFO L93 Difference]: Finished difference Result 8945 states and 20482 transitions. [2018-12-09 04:13:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 04:13:41,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-09 04:13:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:41,682 INFO L225 Difference]: With dead ends: 8945 [2018-12-09 04:13:41,682 INFO L226 Difference]: Without dead ends: 8826 [2018-12-09 04:13:41,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:13:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2018-12-09 04:13:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 6840. [2018-12-09 04:13:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2018-12-09 04:13:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 15654 transitions. [2018-12-09 04:13:41,733 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 15654 transitions. Word has length 72 [2018-12-09 04:13:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:41,733 INFO L480 AbstractCegarLoop]: Abstraction has 6840 states and 15654 transitions. [2018-12-09 04:13:41,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:13:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 15654 transitions. [2018-12-09 04:13:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 04:13:41,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:41,738 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-09 04:13:41,738 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:41,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash 641730713, now seen corresponding path program 1 times [2018-12-09 04:13:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:41,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:41,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:13:41,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:41,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:41,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:41,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:41,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:41,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:41,773 INFO L87 Difference]: Start difference. First operand 6840 states and 15654 transitions. Second operand 4 states. [2018-12-09 04:13:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:41,961 INFO L93 Difference]: Finished difference Result 10607 states and 24141 transitions. [2018-12-09 04:13:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:41,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 04:13:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:41,968 INFO L225 Difference]: With dead ends: 10607 [2018-12-09 04:13:41,968 INFO L226 Difference]: Without dead ends: 10607 [2018-12-09 04:13:41,968 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-09 04:13:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10607 states. [2018-12-09 04:13:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10607 to 7960. [2018-12-09 04:13:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7960 states. [2018-12-09 04:13:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 17988 transitions. [2018-12-09 04:13:42,035 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 17988 transitions. Word has length 91 [2018-12-09 04:13:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:42,035 INFO L480 AbstractCegarLoop]: Abstraction has 7960 states and 17988 transitions. [2018-12-09 04:13:42,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 17988 transitions. [2018-12-09 04:13:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 04:13:42,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:42,041 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-09 04:13:42,041 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:42,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1490266353, now seen corresponding path program 1 times [2018-12-09 04:13:42,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:42,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:42,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:42,077 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-09 04:13:42,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:42,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:42,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:42,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:42,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:42,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:42,078 INFO L87 Difference]: Start difference. First operand 7960 states and 17988 transitions. Second operand 4 states. [2018-12-09 04:13:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:42,147 INFO L93 Difference]: Finished difference Result 8525 states and 19281 transitions. [2018-12-09 04:13:42,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:42,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 04:13:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:42,152 INFO L225 Difference]: With dead ends: 8525 [2018-12-09 04:13:42,153 INFO L226 Difference]: Without dead ends: 8525 [2018-12-09 04:13:42,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2018-12-09 04:13:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 7866. [2018-12-09 04:13:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7866 states. [2018-12-09 04:13:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7866 states to 7866 states and 17883 transitions. [2018-12-09 04:13:42,209 INFO L78 Accepts]: Start accepts. Automaton has 7866 states and 17883 transitions. Word has length 91 [2018-12-09 04:13:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:42,210 INFO L480 AbstractCegarLoop]: Abstraction has 7866 states and 17883 transitions. [2018-12-09 04:13:42,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7866 states and 17883 transitions. [2018-12-09 04:13:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:42,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:42,217 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-09 04:13:42,217 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:42,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1849503775, now seen corresponding path program 1 times [2018-12-09 04:13:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:13:42,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:42,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:13:42,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:42,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:13:42,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:13:42,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:42,285 INFO L87 Difference]: Start difference. First operand 7866 states and 17883 transitions. Second operand 7 states. [2018-12-09 04:13:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:42,674 INFO L93 Difference]: Finished difference Result 9704 states and 21991 transitions. [2018-12-09 04:13:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:42,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 04:13:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:42,681 INFO L225 Difference]: With dead ends: 9704 [2018-12-09 04:13:42,681 INFO L226 Difference]: Without dead ends: 9704 [2018-12-09 04:13:42,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-09 04:13:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7978. [2018-12-09 04:13:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7978 states. [2018-12-09 04:13:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 18203 transitions. [2018-12-09 04:13:42,745 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 18203 transitions. Word has length 93 [2018-12-09 04:13:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:42,746 INFO L480 AbstractCegarLoop]: Abstraction has 7978 states and 18203 transitions. [2018-12-09 04:13:42,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:13:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 18203 transitions. [2018-12-09 04:13:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:42,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:42,751 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-09 04:13:42,751 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:42,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash 286007970, now seen corresponding path program 1 times [2018-12-09 04:13:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:42,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:42,781 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-09 04:13:42,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:42,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:42,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:42,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:42,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:42,781 INFO L87 Difference]: Start difference. First operand 7978 states and 18203 transitions. Second operand 5 states. [2018-12-09 04:13:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:42,851 INFO L93 Difference]: Finished difference Result 8885 states and 20161 transitions. [2018-12-09 04:13:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:42,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 04:13:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:42,859 INFO L225 Difference]: With dead ends: 8885 [2018-12-09 04:13:42,859 INFO L226 Difference]: Without dead ends: 8885 [2018-12-09 04:13:42,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2018-12-09 04:13:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 6874. [2018-12-09 04:13:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2018-12-09 04:13:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 15722 transitions. [2018-12-09 04:13:42,937 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 15722 transitions. Word has length 93 [2018-12-09 04:13:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:42,938 INFO L480 AbstractCegarLoop]: Abstraction has 6874 states and 15722 transitions. [2018-12-09 04:13:42,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 15722 transitions. [2018-12-09 04:13:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:42,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:42,944 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-09 04:13:42,944 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:42,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 31271425, now seen corresponding path program 1 times [2018-12-09 04:13:42,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:42,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:42,981 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-09 04:13:42,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:42,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:42,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:42,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:42,982 INFO L87 Difference]: Start difference. First operand 6874 states and 15722 transitions. Second operand 5 states. [2018-12-09 04:13:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:43,287 INFO L93 Difference]: Finished difference Result 11408 states and 26291 transitions. [2018-12-09 04:13:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:13:43,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 04:13:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:43,294 INFO L225 Difference]: With dead ends: 11408 [2018-12-09 04:13:43,295 INFO L226 Difference]: Without dead ends: 11330 [2018-12-09 04:13:43,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:13:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11330 states. [2018-12-09 04:13:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11330 to 8015. [2018-12-09 04:13:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8015 states. [2018-12-09 04:13:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 18369 transitions. [2018-12-09 04:13:43,363 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 18369 transitions. Word has length 93 [2018-12-09 04:13:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:43,363 INFO L480 AbstractCegarLoop]: Abstraction has 8015 states and 18369 transitions. [2018-12-09 04:13:43,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 18369 transitions. [2018-12-09 04:13:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:43,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:43,369 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-09 04:13:43,369 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:43,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1276035906, now seen corresponding path program 1 times [2018-12-09 04:13:43,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:43,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:43,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:43,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:43,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:43,408 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-09 04:13:43,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:43,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:43,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:43,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:43,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:43,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:43,409 INFO L87 Difference]: Start difference. First operand 8015 states and 18369 transitions. Second operand 6 states. [2018-12-09 04:13:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:43,609 INFO L93 Difference]: Finished difference Result 10150 states and 23091 transitions. [2018-12-09 04:13:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:13:43,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 04:13:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:43,616 INFO L225 Difference]: With dead ends: 10150 [2018-12-09 04:13:43,616 INFO L226 Difference]: Without dead ends: 10071 [2018-12-09 04:13:43,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:13:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10071 states. [2018-12-09 04:13:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10071 to 7614. [2018-12-09 04:13:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-09 04:13:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17479 transitions. [2018-12-09 04:13:43,680 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17479 transitions. Word has length 93 [2018-12-09 04:13:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:43,680 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17479 transitions. [2018-12-09 04:13:43,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17479 transitions. [2018-12-09 04:13:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:43,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:43,685 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-09 04:13:43,685 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:43,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:43,685 INFO L82 PathProgramCache]: Analyzing trace with hash 659591573, now seen corresponding path program 1 times [2018-12-09 04:13:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:43,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:43,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:43,771 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-09 04:13:43,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:43,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:13:43,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:43,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:13:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:13:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:13:43,773 INFO L87 Difference]: Start difference. First operand 7614 states and 17479 transitions. Second operand 9 states. [2018-12-09 04:13:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:44,118 INFO L93 Difference]: Finished difference Result 10662 states and 24405 transitions. [2018-12-09 04:13:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:13:44,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-09 04:13:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:44,125 INFO L225 Difference]: With dead ends: 10662 [2018-12-09 04:13:44,125 INFO L226 Difference]: Without dead ends: 10630 [2018-12-09 04:13:44,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:13:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2018-12-09 04:13:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9163. [2018-12-09 04:13:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2018-12-09 04:13:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 20929 transitions. [2018-12-09 04:13:44,195 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 20929 transitions. Word has length 93 [2018-12-09 04:13:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:44,195 INFO L480 AbstractCegarLoop]: Abstraction has 9163 states and 20929 transitions. [2018-12-09 04:13:44,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:13:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 20929 transitions. [2018-12-09 04:13:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:44,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:44,201 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-09 04:13:44,202 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:44,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1137359786, now seen corresponding path program 1 times [2018-12-09 04:13:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:44,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:44,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:44,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:44,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:13:44,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:44,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:13:44,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:44,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:13:44,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:13:44,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:13:44,263 INFO L87 Difference]: Start difference. First operand 9163 states and 20929 transitions. Second operand 8 states. [2018-12-09 04:13:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:44,541 INFO L93 Difference]: Finished difference Result 14219 states and 32893 transitions. [2018-12-09 04:13:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:13:44,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 04:13:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:44,555 INFO L225 Difference]: With dead ends: 14219 [2018-12-09 04:13:44,555 INFO L226 Difference]: Without dead ends: 14219 [2018-12-09 04:13:44,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:13:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2018-12-09 04:13:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 9753. [2018-12-09 04:13:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9753 states. [2018-12-09 04:13:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 22460 transitions. [2018-12-09 04:13:44,672 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 22460 transitions. Word has length 93 [2018-12-09 04:13:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:44,672 INFO L480 AbstractCegarLoop]: Abstraction has 9753 states and 22460 transitions. [2018-12-09 04:13:44,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:13:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 22460 transitions. [2018-12-09 04:13:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:44,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:44,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:13:44,679 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:44,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash -249856105, now seen corresponding path program 1 times [2018-12-09 04:13:44,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:44,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:44,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:44,762 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-09 04:13:44,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:44,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 04:13:44,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:44,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:13:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:13:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:13:44,763 INFO L87 Difference]: Start difference. First operand 9753 states and 22460 transitions. Second operand 10 states. [2018-12-09 04:13:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:45,222 INFO L93 Difference]: Finished difference Result 13625 states and 31492 transitions. [2018-12-09 04:13:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 04:13:45,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-09 04:13:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:45,234 INFO L225 Difference]: With dead ends: 13625 [2018-12-09 04:13:45,234 INFO L226 Difference]: Without dead ends: 13625 [2018-12-09 04:13:45,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-09 04:13:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13625 states. [2018-12-09 04:13:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13625 to 10970. [2018-12-09 04:13:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10970 states. [2018-12-09 04:13:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 25091 transitions. [2018-12-09 04:13:45,341 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 25091 transitions. Word has length 93 [2018-12-09 04:13:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:45,342 INFO L480 AbstractCegarLoop]: Abstraction has 10970 states and 25091 transitions. [2018-12-09 04:13:45,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:13:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 25091 transitions. [2018-12-09 04:13:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:13:45,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:45,350 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-09 04:13:45,350 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:45,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1981831657, now seen corresponding path program 1 times [2018-12-09 04:13:45,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:45,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:45,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:45,399 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-09 04:13:45,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:45,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:45,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:45,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:45,400 INFO L87 Difference]: Start difference. First operand 10970 states and 25091 transitions. Second operand 6 states. [2018-12-09 04:13:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:45,492 INFO L93 Difference]: Finished difference Result 10490 states and 23635 transitions. [2018-12-09 04:13:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:45,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 04:13:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:45,499 INFO L225 Difference]: With dead ends: 10490 [2018-12-09 04:13:45,499 INFO L226 Difference]: Without dead ends: 10490 [2018-12-09 04:13:45,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:13:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2018-12-09 04:13:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 7136. [2018-12-09 04:13:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2018-12-09 04:13:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16093 transitions. [2018-12-09 04:13:45,564 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16093 transitions. Word has length 93 [2018-12-09 04:13:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:45,564 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16093 transitions. [2018-12-09 04:13:45,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16093 transitions. [2018-12-09 04:13:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:13:45,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:45,569 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-09 04:13:45,569 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:45,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -402802423, now seen corresponding path program 1 times [2018-12-09 04:13:45,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:45,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:45,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:45,627 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-09 04:13:45,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:45,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:13:45,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:45,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:45,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:45,629 INFO L87 Difference]: Start difference. First operand 7136 states and 16093 transitions. Second operand 5 states. [2018-12-09 04:13:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:45,654 INFO L93 Difference]: Finished difference Result 7136 states and 16077 transitions. [2018-12-09 04:13:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:13:45,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-09 04:13:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:45,659 INFO L225 Difference]: With dead ends: 7136 [2018-12-09 04:13:45,659 INFO L226 Difference]: Without dead ends: 7136 [2018-12-09 04:13:45,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2018-12-09 04:13:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 7136. [2018-12-09 04:13:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2018-12-09 04:13:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16077 transitions. [2018-12-09 04:13:45,709 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16077 transitions. Word has length 95 [2018-12-09 04:13:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:45,709 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16077 transitions. [2018-12-09 04:13:45,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16077 transitions. [2018-12-09 04:13:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:13:45,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:45,715 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-09 04:13:45,715 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:45,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash 484701258, now seen corresponding path program 1 times [2018-12-09 04:13:45,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:45,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:45,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:45,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:45,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:45,806 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-09 04:13:45,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:45,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:13:45,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:45,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 04:13:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 04:13:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:13:45,807 INFO L87 Difference]: Start difference. First operand 7136 states and 16077 transitions. Second operand 11 states. [2018-12-09 04:13:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:46,629 INFO L93 Difference]: Finished difference Result 13009 states and 29370 transitions. [2018-12-09 04:13:46,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 04:13:46,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 04:13:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:46,640 INFO L225 Difference]: With dead ends: 13009 [2018-12-09 04:13:46,640 INFO L226 Difference]: Without dead ends: 9288 [2018-12-09 04:13:46,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 04:13:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2018-12-09 04:13:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 6975. [2018-12-09 04:13:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6975 states. [2018-12-09 04:13:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 15659 transitions. [2018-12-09 04:13:46,703 INFO L78 Accepts]: Start accepts. Automaton has 6975 states and 15659 transitions. Word has length 95 [2018-12-09 04:13:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:46,704 INFO L480 AbstractCegarLoop]: Abstraction has 6975 states and 15659 transitions. [2018-12-09 04:13:46,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 04:13:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6975 states and 15659 transitions. [2018-12-09 04:13:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:13:46,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:46,708 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-09 04:13:46,708 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:46,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash -860395469, now seen corresponding path program 1 times [2018-12-09 04:13:46,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:46,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:46,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:46,785 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-09 04:13:46,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:46,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:46,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:46,785 INFO L87 Difference]: Start difference. First operand 6975 states and 15659 transitions. Second operand 6 states. [2018-12-09 04:13:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:46,996 INFO L93 Difference]: Finished difference Result 7816 states and 17333 transitions. [2018-12-09 04:13:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:46,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 04:13:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:47,008 INFO L225 Difference]: With dead ends: 7816 [2018-12-09 04:13:47,008 INFO L226 Difference]: Without dead ends: 7783 [2018-12-09 04:13:47,009 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-09 04:13:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7783 states. [2018-12-09 04:13:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7783 to 6922. [2018-12-09 04:13:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2018-12-09 04:13:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 15422 transitions. [2018-12-09 04:13:47,072 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 15422 transitions. Word has length 95 [2018-12-09 04:13:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:47,072 INFO L480 AbstractCegarLoop]: Abstraction has 6922 states and 15422 transitions. [2018-12-09 04:13:47,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 15422 transitions. [2018-12-09 04:13:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:13:47,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:47,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:13:47,078 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:47,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 2 times [2018-12-09 04:13:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:47,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:47,130 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-09 04:13:47,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:47,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:13:47,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:13:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:47,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:47,130 INFO L87 Difference]: Start difference. First operand 6922 states and 15422 transitions. Second operand 6 states. [2018-12-09 04:13:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:47,227 INFO L93 Difference]: Finished difference Result 7419 states and 16444 transitions. [2018-12-09 04:13:47,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:13:47,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 04:13:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:47,231 INFO L225 Difference]: With dead ends: 7419 [2018-12-09 04:13:47,231 INFO L226 Difference]: Without dead ends: 7419 [2018-12-09 04:13:47,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:13:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2018-12-09 04:13:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 6900. [2018-12-09 04:13:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2018-12-09 04:13:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 15351 transitions. [2018-12-09 04:13:47,281 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 15351 transitions. Word has length 95 [2018-12-09 04:13:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:47,281 INFO L480 AbstractCegarLoop]: Abstraction has 6900 states and 15351 transitions. [2018-12-09 04:13:47,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 15351 transitions. [2018-12-09 04:13:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:13:47,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:47,286 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-09 04:13:47,286 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:13:47,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-12-09 04:13:47,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:13:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:47,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:13:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:47,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:13:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:13:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:13:47,323 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 04:13:47,390 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 04:13:47,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:13:47 BasicIcfg [2018-12-09 04:13:47,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:13:47,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:13:47,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:13:47,391 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:13:47,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:13:30" (3/4) ... [2018-12-09 04:13:47,393 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 04:13:47,462 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fe3a9e20-f4cf-49bf-ba0a-053e0ca8f747/bin-2019/utaipan/witness.graphml [2018-12-09 04:13:47,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:13:47,463 INFO L168 Benchmark]: Toolchain (without parser) took 17826.60 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 952.4 MB in the beginning and 1.3 GB in the end (delta: -329.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-09 04:13:47,464 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:13:47,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:47,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:47,465 INFO L168 Benchmark]: Boogie Preprocessor took 20.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:13:47,465 INFO L168 Benchmark]: RCFGBuilder took 347.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:47,465 INFO L168 Benchmark]: TraceAbstraction took 17018.13 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -307.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 04:13:47,465 INFO L168 Benchmark]: Witness Printer took 71.58 ms. Allocated memory is still 2.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:47,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17018.13 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -307.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 71.58 ms. Allocated memory is still 2.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1293; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1294; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.9s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8464 SDtfs, 9343 SDslu, 19731 SDs, 0 SdLazy, 8931 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 86 SyntacticMatches, 31 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 84291 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2352 ConstructedInterpolants, 0 QuantifiedInterpolants, 527191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...