./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/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 52f250ce523e42d8ac81c9c1780b17f1f4712371 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:26:04,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:26:04,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:26:04,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:26:04,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:26:04,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:26:04,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:26:04,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:26:04,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:26:04,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:26:04,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:26:04,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:26:04,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:26:04,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:26:04,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:26:04,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:26:04,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:26:04,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:26:04,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:26:04,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:26:04,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:26:04,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:26:04,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:26:04,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:26:04,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:26:04,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:26:04,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:26:04,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:26:04,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:26:04,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:26:04,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:26:04,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:26:04,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:26:04,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:26:04,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:26:04,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:26:04,932 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 05:26:04,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:26:04,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:26:04,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:26:04,940 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:26:04,940 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:26:04,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:26:04,941 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:26:04,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:26:04,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:26:04,942 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:26:04,943 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:26:04,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:26:04,943 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:26:04,943 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_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/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 -> 52f250ce523e42d8ac81c9c1780b17f1f4712371 [2018-12-09 05:26:04,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:26:04,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:26:04,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:26:04,970 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:26:04,971 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:26:04,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2018-12-09 05:26:05,008 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/data/1161407c9/613deddac1bd4a2e8c4ded6b89816bf1/FLAGc7598cac3 [2018-12-09 05:26:05,349 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:26:05,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2018-12-09 05:26:05,358 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/data/1161407c9/613deddac1bd4a2e8c4ded6b89816bf1/FLAGc7598cac3 [2018-12-09 05:26:05,369 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/data/1161407c9/613deddac1bd4a2e8c4ded6b89816bf1 [2018-12-09 05:26:05,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:26:05,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:26:05,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:26:05,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:26:05,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:26:05,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05, skipping insertion in model container [2018-12-09 05:26:05,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:26:05,407 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:26:05,599 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:26:05,607 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:26:05,687 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:26:05,718 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:26:05,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05 WrapperNode [2018-12-09 05:26:05,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:26:05,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:26:05,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:26:05,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:26:05,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:26:05,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:26:05,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:26:05,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:26:05,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... [2018-12-09 05:26:05,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:26:05,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:26:05,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:26:05,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:26:05,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/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 05:26:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:26:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:26:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 05:26:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:26:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 05:26:05,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 05:26:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 05:26:05,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 05:26:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 05:26:05,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 05:26:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 05:26:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:26:05,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:26:05,810 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 05:26:06,141 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:26:06,141 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 05:26:06,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:26:06 BoogieIcfgContainer [2018-12-09 05:26:06,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:26:06,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:26:06,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:26:06,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:26:06,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:26:05" (1/3) ... [2018-12-09 05:26:06,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782b688f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:26:06, skipping insertion in model container [2018-12-09 05:26:06,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:05" (2/3) ... [2018-12-09 05:26:06,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782b688f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:26:06, skipping insertion in model container [2018-12-09 05:26:06,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:26:06" (3/3) ... [2018-12-09 05:26:06,146 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt_false-unreach-call.i [2018-12-09 05:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,168 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:26:06,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 05:26:06,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:26:06,188 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 05:26:06,197 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 05:26:06,213 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:26:06,213 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:26:06,213 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:26:06,213 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:26:06,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:26:06,213 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:26:06,213 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:26:06,213 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:26:06,220 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 05:26:20,594 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 05:26:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 05:26:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 05:26:20,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:26:20,603 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] [2018-12-09 05:26:20,605 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:26:20,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:26:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash 961127934, now seen corresponding path program 1 times [2018-12-09 05:26:20,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:26:20,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:20,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:26:20,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:20,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:26:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:26:20,751 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 05:26:20,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:26:20,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:26:20,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:26:20,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:26:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:26:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:26:20,765 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 05:26:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:26:22,136 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 05:26:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:26:22,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 05:26:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:26:24,686 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 05:26:24,687 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 05:26:24,688 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 05:26:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 05:26:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 05:26:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 05:26:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 05:26:28,011 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 05:26:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:26:28,012 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 05:26:28,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:26:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 05:26:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 05:26:28,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:26:28,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:26:28,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:26:28,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:26:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -94457539, now seen corresponding path program 1 times [2018-12-09 05:26:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:26:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:28,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:26:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:28,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:26:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:26:28,078 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 05:26:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:26:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:26:28,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:26:28,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:26:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:26:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:26:28,081 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 05:26:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:26:28,928 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 05:26:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:26:28,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 05:26:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:26:29,255 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 05:26:29,255 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 05:26:29,255 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 05:26:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 05:26:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 05:26:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 05:26:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 05:26:31,862 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 05:26:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:26:31,862 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 05:26:31,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:26:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 05:26:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 05:26:31,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:26:31,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:26:31,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:26:31,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:26:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1901912002, now seen corresponding path program 1 times [2018-12-09 05:26:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:26:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:31,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:26:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:31,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:26:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:26:31,923 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 05:26:31,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:26:31,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:26:31,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:26:31,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:26:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:26:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:26:31,924 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 05:26:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:26:33,826 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 05:26:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:26:33,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 05:26:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:26:34,696 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 05:26:34,697 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 05:26:34,697 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 05:26:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 05:26:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 05:26:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 05:26:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 05:26:42,072 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 05:26:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:26:42,072 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 05:26:42,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:26:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 05:26:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 05:26:42,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:26:42,080 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] [2018-12-09 05:26:42,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:26:42,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:26:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 945118259, now seen corresponding path program 1 times [2018-12-09 05:26:42,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:26:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:42,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:26:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:42,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:26:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:26:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:26:42,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:26:42,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:26:42,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:26:42,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:26:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:26:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:26:42,121 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 3 states. [2018-12-09 05:26:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:26:42,974 INFO L93 Difference]: Finished difference Result 186422 states and 840549 transitions. [2018-12-09 05:26:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:26:42,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-09 05:26:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:26:43,451 INFO L225 Difference]: With dead ends: 186422 [2018-12-09 05:26:43,451 INFO L226 Difference]: Without dead ends: 186422 [2018-12-09 05:26:43,451 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 05:26:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186422 states. [2018-12-09 05:26:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186422 to 186422. [2018-12-09 05:26:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 05:26:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840549 transitions. [2018-12-09 05:26:50,661 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840549 transitions. Word has length 51 [2018-12-09 05:26:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:26:50,662 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840549 transitions. [2018-12-09 05:26:50,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:26:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840549 transitions. [2018-12-09 05:26:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 05:26:50,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:26:50,667 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] [2018-12-09 05:26:50,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:26:50,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:26:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1607038702, now seen corresponding path program 1 times [2018-12-09 05:26:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:26:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:26:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:50,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:26:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:26:50,694 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 05:26:50,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:26:50,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:26:50,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:26:50,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:26:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:26:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:26:50,695 INFO L87 Difference]: Start difference. First operand 186422 states and 840549 transitions. Second operand 4 states. [2018-12-09 05:26:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:26:51,419 INFO L93 Difference]: Finished difference Result 163598 states and 725160 transitions. [2018-12-09 05:26:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:26:51,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 05:26:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:26:51,821 INFO L225 Difference]: With dead ends: 163598 [2018-12-09 05:26:51,821 INFO L226 Difference]: Without dead ends: 160993 [2018-12-09 05:26:51,821 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 05:26:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-09 05:26:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-09 05:26:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-09 05:26:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716488 transitions. [2018-12-09 05:26:55,299 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716488 transitions. Word has length 51 [2018-12-09 05:26:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:26:55,299 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716488 transitions. [2018-12-09 05:26:55,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:26:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716488 transitions. [2018-12-09 05:26:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 05:26:55,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:26:55,304 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 05:26:55,304 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:26:55,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:26:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 18302830, now seen corresponding path program 1 times [2018-12-09 05:26:55,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:26:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:55,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:26:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:26:55,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:26:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:26:55,360 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 05:26:55,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:26:55,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:26:55,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:26:55,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:26:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:26:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:26:55,361 INFO L87 Difference]: Start difference. First operand 160993 states and 716488 transitions. Second operand 5 states. [2018-12-09 05:26:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:26:57,166 INFO L93 Difference]: Finished difference Result 289849 states and 1285293 transitions. [2018-12-09 05:26:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:26:57,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 05:26:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:26:57,897 INFO L225 Difference]: With dead ends: 289849 [2018-12-09 05:26:57,897 INFO L226 Difference]: Without dead ends: 289009 [2018-12-09 05:26:57,897 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 05:26:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289009 states. [2018-12-09 05:27:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289009 to 169613. [2018-12-09 05:27:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169613 states. [2018-12-09 05:27:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169613 states to 169613 states and 752341 transitions. [2018-12-09 05:27:04,735 INFO L78 Accepts]: Start accepts. Automaton has 169613 states and 752341 transitions. Word has length 52 [2018-12-09 05:27:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:04,735 INFO L480 AbstractCegarLoop]: Abstraction has 169613 states and 752341 transitions. [2018-12-09 05:27:04,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:27:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 169613 states and 752341 transitions. [2018-12-09 05:27:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 05:27:04,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:04,756 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] [2018-12-09 05:27:04,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:04,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1846844042, now seen corresponding path program 1 times [2018-12-09 05:27:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:04,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:04,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:04,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:04,795 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 05:27:04,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:04,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:27:04,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:04,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:27:04,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:27:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:27:04,796 INFO L87 Difference]: Start difference. First operand 169613 states and 752341 transitions. Second operand 5 states. [2018-12-09 05:27:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:05,026 INFO L93 Difference]: Finished difference Result 59117 states and 239313 transitions. [2018-12-09 05:27:05,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:27:05,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-09 05:27:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:05,138 INFO L225 Difference]: With dead ends: 59117 [2018-12-09 05:27:05,139 INFO L226 Difference]: Without dead ends: 56805 [2018-12-09 05:27:05,139 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 05:27:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56805 states. [2018-12-09 05:27:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56805 to 56805. [2018-12-09 05:27:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56805 states. [2018-12-09 05:27:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56805 states to 56805 states and 230659 transitions. [2018-12-09 05:27:05,963 INFO L78 Accepts]: Start accepts. Automaton has 56805 states and 230659 transitions. Word has length 59 [2018-12-09 05:27:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:05,964 INFO L480 AbstractCegarLoop]: Abstraction has 56805 states and 230659 transitions. [2018-12-09 05:27:05,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:27:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 56805 states and 230659 transitions. [2018-12-09 05:27:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 05:27:05,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:05,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:05,973 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:05,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1949259451, now seen corresponding path program 1 times [2018-12-09 05:27:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:05,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:05,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:05,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:05,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:27:06,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:06,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:27:06,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:06,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:27:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:27:06,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:27:06,013 INFO L87 Difference]: Start difference. First operand 56805 states and 230659 transitions. Second operand 4 states. [2018-12-09 05:27:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:06,910 INFO L93 Difference]: Finished difference Result 80270 states and 321738 transitions. [2018-12-09 05:27:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:27:06,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 05:27:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:07,076 INFO L225 Difference]: With dead ends: 80270 [2018-12-09 05:27:07,076 INFO L226 Difference]: Without dead ends: 80270 [2018-12-09 05:27:07,077 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 05:27:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80270 states. [2018-12-09 05:27:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80270 to 72201. [2018-12-09 05:27:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72201 states. [2018-12-09 05:27:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72201 states to 72201 states and 291246 transitions. [2018-12-09 05:27:08,156 INFO L78 Accepts]: Start accepts. Automaton has 72201 states and 291246 transitions. Word has length 65 [2018-12-09 05:27:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:08,156 INFO L480 AbstractCegarLoop]: Abstraction has 72201 states and 291246 transitions. [2018-12-09 05:27:08,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:27:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 72201 states and 291246 transitions. [2018-12-09 05:27:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 05:27:08,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:08,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:08,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:08,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:08,167 INFO L82 PathProgramCache]: Analyzing trace with hash 952187098, now seen corresponding path program 1 times [2018-12-09 05:27:08,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:08,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:08,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:08,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:08,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:08,210 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 05:27:08,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:08,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:27:08,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:08,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:27:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:27:08,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:08,211 INFO L87 Difference]: Start difference. First operand 72201 states and 291246 transitions. Second operand 6 states. [2018-12-09 05:27:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:08,262 INFO L93 Difference]: Finished difference Result 10873 states and 37510 transitions. [2018-12-09 05:27:08,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:27:08,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 05:27:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:08,276 INFO L225 Difference]: With dead ends: 10873 [2018-12-09 05:27:08,276 INFO L226 Difference]: Without dead ends: 9621 [2018-12-09 05:27:08,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:27:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9621 states. [2018-12-09 05:27:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9621 to 9586. [2018-12-09 05:27:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9586 states. [2018-12-09 05:27:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9586 states to 9586 states and 32946 transitions. [2018-12-09 05:27:08,373 INFO L78 Accepts]: Start accepts. Automaton has 9586 states and 32946 transitions. Word has length 65 [2018-12-09 05:27:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:08,374 INFO L480 AbstractCegarLoop]: Abstraction has 9586 states and 32946 transitions. [2018-12-09 05:27:08,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:27:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9586 states and 32946 transitions. [2018-12-09 05:27:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:27:08,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:08,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:08,384 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:08,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash -228422194, now seen corresponding path program 1 times [2018-12-09 05:27:08,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:08,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:08,410 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 05:27:08,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:08,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:27:08,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:08,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:27:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:27:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:27:08,411 INFO L87 Difference]: Start difference. First operand 9586 states and 32946 transitions. Second operand 3 states. [2018-12-09 05:27:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:08,501 INFO L93 Difference]: Finished difference Result 10146 states and 34654 transitions. [2018-12-09 05:27:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:27:08,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 05:27:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:08,513 INFO L225 Difference]: With dead ends: 10146 [2018-12-09 05:27:08,513 INFO L226 Difference]: Without dead ends: 10146 [2018-12-09 05:27:08,513 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 05:27:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10146 states. [2018-12-09 05:27:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10146 to 9866. [2018-12-09 05:27:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9866 states. [2018-12-09 05:27:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 33800 transitions. [2018-12-09 05:27:08,853 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 33800 transitions. Word has length 98 [2018-12-09 05:27:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:08,853 INFO L480 AbstractCegarLoop]: Abstraction has 9866 states and 33800 transitions. [2018-12-09 05:27:08,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:27:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 33800 transitions. [2018-12-09 05:27:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:27:08,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:08,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:08,863 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:08,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1944048359, now seen corresponding path program 1 times [2018-12-09 05:27:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:08,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:08,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:08,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:08,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:08,915 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 05:27:08,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:08,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:27:08,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:08,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:27:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:27:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:27:08,917 INFO L87 Difference]: Start difference. First operand 9866 states and 33800 transitions. Second operand 5 states. [2018-12-09 05:27:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:09,063 INFO L93 Difference]: Finished difference Result 11874 states and 40032 transitions. [2018-12-09 05:27:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:27:09,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 05:27:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:09,077 INFO L225 Difference]: With dead ends: 11874 [2018-12-09 05:27:09,077 INFO L226 Difference]: Without dead ends: 11774 [2018-12-09 05:27:09,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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 05:27:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11774 states. [2018-12-09 05:27:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11774 to 10541. [2018-12-09 05:27:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10541 states. [2018-12-09 05:27:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 35845 transitions. [2018-12-09 05:27:09,189 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 35845 transitions. Word has length 98 [2018-12-09 05:27:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:09,189 INFO L480 AbstractCegarLoop]: Abstraction has 10541 states and 35845 transitions. [2018-12-09 05:27:09,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:27:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 35845 transitions. [2018-12-09 05:27:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:27:09,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:09,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:09,200 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:09,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -49676000, now seen corresponding path program 1 times [2018-12-09 05:27:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:09,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:09,244 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 05:27:09,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:09,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:27:09,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:09,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:27:09,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:27:09,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:27:09,245 INFO L87 Difference]: Start difference. First operand 10541 states and 35845 transitions. Second operand 4 states. [2018-12-09 05:27:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:09,386 INFO L93 Difference]: Finished difference Result 18037 states and 61515 transitions. [2018-12-09 05:27:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:27:09,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 05:27:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:09,407 INFO L225 Difference]: With dead ends: 18037 [2018-12-09 05:27:09,407 INFO L226 Difference]: Without dead ends: 17937 [2018-12-09 05:27:09,407 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 05:27:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17937 states. [2018-12-09 05:27:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17937 to 9996. [2018-12-09 05:27:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2018-12-09 05:27:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 33674 transitions. [2018-12-09 05:27:09,544 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 33674 transitions. Word has length 100 [2018-12-09 05:27:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:09,544 INFO L480 AbstractCegarLoop]: Abstraction has 9996 states and 33674 transitions. [2018-12-09 05:27:09,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:27:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 33674 transitions. [2018-12-09 05:27:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:27:09,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:09,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:09,555 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:09,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:09,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1233023297, now seen corresponding path program 1 times [2018-12-09 05:27:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:09,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:09,631 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 05:27:09,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:09,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:27:09,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:09,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:27:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:27:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:09,632 INFO L87 Difference]: Start difference. First operand 9996 states and 33674 transitions. Second operand 6 states. [2018-12-09 05:27:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:09,789 INFO L93 Difference]: Finished difference Result 12576 states and 41663 transitions. [2018-12-09 05:27:09,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:27:09,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:27:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:09,804 INFO L225 Difference]: With dead ends: 12576 [2018-12-09 05:27:09,804 INFO L226 Difference]: Without dead ends: 12576 [2018-12-09 05:27:09,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2018-12-09 05:27:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 10376. [2018-12-09 05:27:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-09 05:27:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 34908 transitions. [2018-12-09 05:27:09,912 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 34908 transitions. Word has length 100 [2018-12-09 05:27:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:09,912 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 34908 transitions. [2018-12-09 05:27:09,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:27:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 34908 transitions. [2018-12-09 05:27:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:27:09,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:09,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:09,922 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:09,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -263442274, now seen corresponding path program 1 times [2018-12-09 05:27:09,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:09,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:09,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:09,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:09,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:09,984 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 05:27:09,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:09,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:27:09,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:09,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:27:09,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:27:09,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:09,985 INFO L87 Difference]: Start difference. First operand 10376 states and 34908 transitions. Second operand 6 states. [2018-12-09 05:27:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:10,164 INFO L93 Difference]: Finished difference Result 9240 states and 30906 transitions. [2018-12-09 05:27:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:27:10,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:27:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:10,175 INFO L225 Difference]: With dead ends: 9240 [2018-12-09 05:27:10,175 INFO L226 Difference]: Without dead ends: 9240 [2018-12-09 05:27:10,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:27:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2018-12-09 05:27:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 8996. [2018-12-09 05:27:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8996 states. [2018-12-09 05:27:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8996 states to 8996 states and 30179 transitions. [2018-12-09 05:27:10,264 INFO L78 Accepts]: Start accepts. Automaton has 8996 states and 30179 transitions. Word has length 100 [2018-12-09 05:27:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:10,265 INFO L480 AbstractCegarLoop]: Abstraction has 8996 states and 30179 transitions. [2018-12-09 05:27:10,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:27:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8996 states and 30179 transitions. [2018-12-09 05:27:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:27:10,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:10,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:10,273 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:10,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1775504736, now seen corresponding path program 1 times [2018-12-09 05:27:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:10,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:10,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:10,322 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 05:27:10,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:10,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:27:10,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:10,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:27:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:27:10,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:10,323 INFO L87 Difference]: Start difference. First operand 8996 states and 30179 transitions. Second operand 7 states. [2018-12-09 05:27:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:10,522 INFO L93 Difference]: Finished difference Result 10469 states and 34663 transitions. [2018-12-09 05:27:10,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:27:10,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 05:27:10,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:10,533 INFO L225 Difference]: With dead ends: 10469 [2018-12-09 05:27:10,533 INFO L226 Difference]: Without dead ends: 10469 [2018-12-09 05:27:10,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10469 states. [2018-12-09 05:27:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10469 to 9426. [2018-12-09 05:27:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2018-12-09 05:27:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 31298 transitions. [2018-12-09 05:27:10,628 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 31298 transitions. Word has length 100 [2018-12-09 05:27:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:10,628 INFO L480 AbstractCegarLoop]: Abstraction has 9426 states and 31298 transitions. [2018-12-09 05:27:10,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:27:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 31298 transitions. [2018-12-09 05:27:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:27:10,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:10,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:10,637 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:10,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1336115263, now seen corresponding path program 1 times [2018-12-09 05:27:10,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:10,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:10,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:10,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:10,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:10,701 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 05:27:10,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:10,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:27:10,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:10,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:27:10,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:27:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:27:10,702 INFO L87 Difference]: Start difference. First operand 9426 states and 31298 transitions. Second operand 5 states. [2018-12-09 05:27:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:10,782 INFO L93 Difference]: Finished difference Result 9256 states and 30592 transitions. [2018-12-09 05:27:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:27:10,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 05:27:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:10,791 INFO L225 Difference]: With dead ends: 9256 [2018-12-09 05:27:10,791 INFO L226 Difference]: Without dead ends: 9256 [2018-12-09 05:27:10,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9256 states. [2018-12-09 05:27:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9256 to 8636. [2018-12-09 05:27:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2018-12-09 05:27:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 28851 transitions. [2018-12-09 05:27:10,874 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 28851 transitions. Word has length 100 [2018-12-09 05:27:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:10,874 INFO L480 AbstractCegarLoop]: Abstraction has 8636 states and 28851 transitions. [2018-12-09 05:27:10,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:27:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 28851 transitions. [2018-12-09 05:27:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:27:10,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:10,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:10,882 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:10,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1937051776, now seen corresponding path program 1 times [2018-12-09 05:27:10,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:10,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:10,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:10,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:10,996 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 05:27:10,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:27:10,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:10,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:27:10,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:27:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:10,997 INFO L87 Difference]: Start difference. First operand 8636 states and 28851 transitions. Second operand 6 states. [2018-12-09 05:27:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:11,055 INFO L93 Difference]: Finished difference Result 7484 states and 24403 transitions. [2018-12-09 05:27:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:27:11,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:27:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:11,063 INFO L225 Difference]: With dead ends: 7484 [2018-12-09 05:27:11,063 INFO L226 Difference]: Without dead ends: 7484 [2018-12-09 05:27:11,063 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 05:27:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2018-12-09 05:27:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6651. [2018-12-09 05:27:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6651 states. [2018-12-09 05:27:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6651 states to 6651 states and 21805 transitions. [2018-12-09 05:27:11,129 INFO L78 Accepts]: Start accepts. Automaton has 6651 states and 21805 transitions. Word has length 100 [2018-12-09 05:27:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:11,129 INFO L480 AbstractCegarLoop]: Abstraction has 6651 states and 21805 transitions. [2018-12-09 05:27:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:27:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6651 states and 21805 transitions. [2018-12-09 05:27:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:11,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:11,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:11,136 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:11,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash -986687851, now seen corresponding path program 1 times [2018-12-09 05:27:11,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:11,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:11,200 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 05:27:11,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:11,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:27:11,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:11,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:27:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:27:11,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:11,200 INFO L87 Difference]: Start difference. First operand 6651 states and 21805 transitions. Second operand 7 states. [2018-12-09 05:27:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:11,506 INFO L93 Difference]: Finished difference Result 12208 states and 39612 transitions. [2018-12-09 05:27:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 05:27:11,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:27:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:11,518 INFO L225 Difference]: With dead ends: 12208 [2018-12-09 05:27:11,518 INFO L226 Difference]: Without dead ends: 12208 [2018-12-09 05:27:11,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:27:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12208 states. [2018-12-09 05:27:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12208 to 9633. [2018-12-09 05:27:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9633 states. [2018-12-09 05:27:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9633 states to 9633 states and 31663 transitions. [2018-12-09 05:27:11,624 INFO L78 Accepts]: Start accepts. Automaton has 9633 states and 31663 transitions. Word has length 102 [2018-12-09 05:27:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:11,624 INFO L480 AbstractCegarLoop]: Abstraction has 9633 states and 31663 transitions. [2018-12-09 05:27:11,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:27:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9633 states and 31663 transitions. [2018-12-09 05:27:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:11,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:11,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:11,633 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:11,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 258076630, now seen corresponding path program 1 times [2018-12-09 05:27:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:11,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:11,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:11,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:11,692 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 05:27:11,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:11,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:27:11,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:11,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:27:11,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:27:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:11,693 INFO L87 Difference]: Start difference. First operand 9633 states and 31663 transitions. Second operand 6 states. [2018-12-09 05:27:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:11,778 INFO L93 Difference]: Finished difference Result 9833 states and 32038 transitions. [2018-12-09 05:27:11,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:27:11,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 05:27:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:11,788 INFO L225 Difference]: With dead ends: 9833 [2018-12-09 05:27:11,788 INFO L226 Difference]: Without dead ends: 9833 [2018-12-09 05:27:11,789 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 05:27:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9833 states. [2018-12-09 05:27:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9833 to 9558. [2018-12-09 05:27:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9558 states. [2018-12-09 05:27:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9558 states to 9558 states and 31283 transitions. [2018-12-09 05:27:11,880 INFO L78 Accepts]: Start accepts. Automaton has 9558 states and 31283 transitions. Word has length 102 [2018-12-09 05:27:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:11,880 INFO L480 AbstractCegarLoop]: Abstraction has 9558 states and 31283 transitions. [2018-12-09 05:27:11,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:27:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9558 states and 31283 transitions. [2018-12-09 05:27:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:11,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:11,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:11,888 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:11,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash -656922090, now seen corresponding path program 1 times [2018-12-09 05:27:11,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:11,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:11,942 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 05:27:11,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:11,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:27:11,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:11,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:27:11,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:27:11,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:27:11,943 INFO L87 Difference]: Start difference. First operand 9558 states and 31283 transitions. Second operand 6 states. [2018-12-09 05:27:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:12,071 INFO L93 Difference]: Finished difference Result 17890 states and 59369 transitions. [2018-12-09 05:27:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:27:12,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 05:27:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:12,093 INFO L225 Difference]: With dead ends: 17890 [2018-12-09 05:27:12,093 INFO L226 Difference]: Without dead ends: 17890 [2018-12-09 05:27:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:27:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17890 states. [2018-12-09 05:27:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17890 to 9878. [2018-12-09 05:27:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9878 states. [2018-12-09 05:27:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 32149 transitions. [2018-12-09 05:27:12,233 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 32149 transitions. Word has length 102 [2018-12-09 05:27:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:12,233 INFO L480 AbstractCegarLoop]: Abstraction has 9878 states and 32149 transitions. [2018-12-09 05:27:12,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:27:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 32149 transitions. [2018-12-09 05:27:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:12,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:12,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:12,242 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:12,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 476268503, now seen corresponding path program 1 times [2018-12-09 05:27:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:12,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:12,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:12,294 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 05:27:12,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:12,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:27:12,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:12,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:27:12,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:27:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:27:12,295 INFO L87 Difference]: Start difference. First operand 9878 states and 32149 transitions. Second operand 5 states. [2018-12-09 05:27:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:12,432 INFO L93 Difference]: Finished difference Result 11158 states and 36309 transitions. [2018-12-09 05:27:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:27:12,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 05:27:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:12,444 INFO L225 Difference]: With dead ends: 11158 [2018-12-09 05:27:12,444 INFO L226 Difference]: Without dead ends: 11158 [2018-12-09 05:27:12,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11158 states. [2018-12-09 05:27:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11158 to 8720. [2018-12-09 05:27:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8720 states. [2018-12-09 05:27:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8720 states to 8720 states and 28488 transitions. [2018-12-09 05:27:12,536 INFO L78 Accepts]: Start accepts. Automaton has 8720 states and 28488 transitions. Word has length 102 [2018-12-09 05:27:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:12,537 INFO L480 AbstractCegarLoop]: Abstraction has 8720 states and 28488 transitions. [2018-12-09 05:27:12,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:27:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8720 states and 28488 transitions. [2018-12-09 05:27:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:12,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:12,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:12,544 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:12,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1721032984, now seen corresponding path program 1 times [2018-12-09 05:27:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:12,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:12,602 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 05:27:12,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:12,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:27:12,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:12,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:27:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:27:12,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:12,603 INFO L87 Difference]: Start difference. First operand 8720 states and 28488 transitions. Second operand 7 states. [2018-12-09 05:27:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:12,795 INFO L93 Difference]: Finished difference Result 16018 states and 52947 transitions. [2018-12-09 05:27:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:27:12,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:27:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:12,805 INFO L225 Difference]: With dead ends: 16018 [2018-12-09 05:27:12,805 INFO L226 Difference]: Without dead ends: 8058 [2018-12-09 05:27:12,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:27:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8058 states. [2018-12-09 05:27:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8058 to 8028. [2018-12-09 05:27:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8028 states. [2018-12-09 05:27:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8028 states to 8028 states and 26448 transitions. [2018-12-09 05:27:12,883 INFO L78 Accepts]: Start accepts. Automaton has 8028 states and 26448 transitions. Word has length 102 [2018-12-09 05:27:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:12,883 INFO L480 AbstractCegarLoop]: Abstraction has 8028 states and 26448 transitions. [2018-12-09 05:27:12,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:27:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8028 states and 26448 transitions. [2018-12-09 05:27:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:12,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:12,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:12,891 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:12,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 84668374, now seen corresponding path program 2 times [2018-12-09 05:27:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:12,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:12,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:13,010 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 05:27:13,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:13,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 05:27:13,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:13,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:27:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:27:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:27:13,011 INFO L87 Difference]: Start difference. First operand 8028 states and 26448 transitions. Second operand 10 states. [2018-12-09 05:27:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:13,321 INFO L93 Difference]: Finished difference Result 14770 states and 49387 transitions. [2018-12-09 05:27:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:27:13,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 05:27:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:13,329 INFO L225 Difference]: With dead ends: 14770 [2018-12-09 05:27:13,329 INFO L226 Difference]: Without dead ends: 6821 [2018-12-09 05:27:13,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:27:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-09 05:27:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-09 05:27:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-09 05:27:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-09 05:27:13,425 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-09 05:27:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:13,425 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-09 05:27:13,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:27:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-09 05:27:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:13,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:13,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:13,431 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:13,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1082345370, now seen corresponding path program 1 times [2018-12-09 05:27:13,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:13,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:27:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:13,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:27:13,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:13,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:27:13,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:13,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:27:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:27:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:13,522 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-09 05:27:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:13,728 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-09 05:27:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:27:13,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:27:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:13,738 INFO L225 Difference]: With dead ends: 8957 [2018-12-09 05:27:13,738 INFO L226 Difference]: Without dead ends: 8821 [2018-12-09 05:27:13,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:27:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-09 05:27:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-09 05:27:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-09 05:27:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-09 05:27:13,810 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-09 05:27:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:13,810 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-09 05:27:13,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:27:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-09 05:27:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:13,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:13,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:13,817 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:13,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash -853314917, now seen corresponding path program 1 times [2018-12-09 05:27:13,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:13,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:13,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:13,891 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 05:27:13,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:13,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:27:13,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:13,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:27:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:27:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:27:13,892 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 7 states. [2018-12-09 05:27:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:14,040 INFO L93 Difference]: Finished difference Result 13593 states and 46438 transitions. [2018-12-09 05:27:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:27:14,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:27:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:14,056 INFO L225 Difference]: With dead ends: 13593 [2018-12-09 05:27:14,056 INFO L226 Difference]: Without dead ends: 13593 [2018-12-09 05:27:14,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:27:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2018-12-09 05:27:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 6965. [2018-12-09 05:27:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6965 states. [2018-12-09 05:27:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 23455 transitions. [2018-12-09 05:27:14,152 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 23455 transitions. Word has length 102 [2018-12-09 05:27:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:14,153 INFO L480 AbstractCegarLoop]: Abstraction has 6965 states and 23455 transitions. [2018-12-09 05:27:14,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:27:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 23455 transitions. [2018-12-09 05:27:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:14,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:14,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:14,159 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:14,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1740911900, now seen corresponding path program 3 times [2018-12-09 05:27:14,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:14,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:27:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:14,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:27:14,239 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 05:27:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:27:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 05:27:14,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:27:14,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 05:27:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 05:27:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:27:14,240 INFO L87 Difference]: Start difference. First operand 6965 states and 23455 transitions. Second operand 12 states. [2018-12-09 05:27:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:27:14,561 INFO L93 Difference]: Finished difference Result 13529 states and 45706 transitions. [2018-12-09 05:27:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:27:14,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 05:27:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:27:14,571 INFO L225 Difference]: With dead ends: 13529 [2018-12-09 05:27:14,571 INFO L226 Difference]: Without dead ends: 9625 [2018-12-09 05:27:14,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 05:27:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2018-12-09 05:27:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 9017. [2018-12-09 05:27:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9017 states. [2018-12-09 05:27:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 29626 transitions. [2018-12-09 05:27:14,660 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 29626 transitions. Word has length 102 [2018-12-09 05:27:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:27:14,660 INFO L480 AbstractCegarLoop]: Abstraction has 9017 states and 29626 transitions. [2018-12-09 05:27:14,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 05:27:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 29626 transitions. [2018-12-09 05:27:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:27:14,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:27:14,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:27:14,668 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:27:14,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:27:14,668 INFO L82 PathProgramCache]: Analyzing trace with hash -141622302, now seen corresponding path program 4 times [2018-12-09 05:27:14,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:27:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:14,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:27:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:27:14,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:27:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:27:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:27:14,708 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:27:14,788 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 05:27:14,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:27:14 BasicIcfg [2018-12-09 05:27:14,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:27:14,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:27:14,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:27:14,789 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:27:14,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:26:06" (3/4) ... [2018-12-09 05:27:14,791 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:27:14,861 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7fb3cb72-d5a8-4ced-81cf-65651e3e0c3d/bin-2019/utaipan/witness.graphml [2018-12-09 05:27:14,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:27:14,862 INFO L168 Benchmark]: Toolchain (without parser) took 69491.25 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 952.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,863 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:27:14,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,863 INFO L168 Benchmark]: Boogie Preprocessor took 21.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,864 INFO L168 Benchmark]: RCFGBuilder took 366.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,864 INFO L168 Benchmark]: TraceAbstraction took 68646.82 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,864 INFO L168 Benchmark]: Witness Printer took 72.68 ms. Allocated memory is still 6.3 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:27:14,865 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68646.82 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 72.68 ms. Allocated memory is still 6.3 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=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, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L778] -1 pthread_t t2524; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L779] FCALL, FORK -1 pthread_create(&t2524, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L780] -1 pthread_t t2525; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L781] FCALL, FORK -1 pthread_create(&t2525, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L782] -1 pthread_t t2526; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L783] FCALL, FORK -1 pthread_create(&t2526, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L704] 1 z = 2 [L709] 1 __unbuffered_p0_EAX = x [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L721] 2 x = 1 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] EXPR 2 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L729] 2 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 [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, 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, z=2] [L731] 2 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 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -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) [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L790] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L791] 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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] -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 [L792] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L793] 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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] -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 [L796] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L797] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L798] -1 y$flush_delayed = weak$$choice2 [L799] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L806] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] -1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] -1 y = y$flush_delayed ? y$mem_tmp : y [L809] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 68.5s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5875 SDtfs, 6071 SDslu, 13784 SDs, 0 SdLazy, 4369 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 78 SyntacticMatches, 16 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, 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: 34.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 387156 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2302 NumberOfCodeBlocks, 2302 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2174 ConstructedInterpolants, 0 QuantifiedInterpolants, 482629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...