./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/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 8779471c632a53a1c78816502893e61b74924e89 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:27:53,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:27:53,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:27:53,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:27:53,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:27:53,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:27:53,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:27:53,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:27:53,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:27:53,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:27:53,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:27:53,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:27:53,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:27:53,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:27:53,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:27:53,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:27:53,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:27:53,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:27:53,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:27:53,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:27:53,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:27:53,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:27:53,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:27:53,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:27:53,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:27:53,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:27:53,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:27:53,886 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:27:53,887 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:27:53,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:27:53,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:27:53,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:27:53,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:27:53,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:27:53,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:27:53,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:27:53,890 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:27:53,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:27:53,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:27:53,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:27:53,901 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:27:53,901 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:27:53,901 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:27:53,901 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:27:53,901 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:27:53,902 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:27:53,902 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:27:53,902 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:27:53,902 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:27:53,902 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:27:53,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:27:53,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:27:53,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:27:53,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:27:53,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:27:53,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:27:53,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:27:53,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:27:53,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:27:53,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:27:53,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:27:53,905 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:27:53,905 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:27:53,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:27:53,905 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:27:53,905 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_934ac932-3eea-41cf-b9e0-4b61ede9091f/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 -> 8779471c632a53a1c78816502893e61b74924e89 [2018-12-09 17:27:53,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:27:53,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:27:53,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:27:53,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:27:53,941 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:27:53,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-09 17:27:53,980 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/data/4819973ee/97cc9e5b59ef4e54bfa1abca4859a233/FLAG2a5711ddb [2018-12-09 17:27:54,395 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:27:54,396 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-09 17:27:54,403 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/data/4819973ee/97cc9e5b59ef4e54bfa1abca4859a233/FLAG2a5711ddb [2018-12-09 17:27:54,411 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/data/4819973ee/97cc9e5b59ef4e54bfa1abca4859a233 [2018-12-09 17:27:54,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:27:54,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:27:54,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:27:54,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:27:54,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:27:54,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54, skipping insertion in model container [2018-12-09 17:27:54,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:27:54,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:27:54,632 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:27:54,640 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:27:54,712 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:27:54,743 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:27:54,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54 WrapperNode [2018-12-09 17:27:54,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:27:54,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:27:54,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:27:54,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:27:54,749 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:27:54" (1/1) ... [2018-12-09 17:27:54,758 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:27:54" (1/1) ... [2018-12-09 17:27:54,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:27:54,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:27:54,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:27:54,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:27:54,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... [2018-12-09 17:27:54,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:27:54,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:27:54,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:27:54,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:27:54,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/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 17:27:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 17:27:54,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 17:27:54,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 17:27:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:27:54,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:27:54,832 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 17:27:55,151 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:27:55,151 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 17:27:55,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:27:55 BoogieIcfgContainer [2018-12-09 17:27:55,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:27:55,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:27:55,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:27:55,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:27:55,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:27:54" (1/3) ... [2018-12-09 17:27:55,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab87600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:27:55, skipping insertion in model container [2018-12-09 17:27:55,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:27:54" (2/3) ... [2018-12-09 17:27:55,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab87600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:27:55, skipping insertion in model container [2018-12-09 17:27:55,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:27:55" (3/3) ... [2018-12-09 17:27:55,156 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc_false-unreach-call.i [2018-12-09 17:27:55,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,178 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,178 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:27:55,190 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 17:27:55,190 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:27:55,196 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 17:27:55,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 17:27:55,221 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:27:55,221 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:27:55,221 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:27:55,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:27:55,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:27:55,221 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:27:55,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:27:55,222 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:27:55,231 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 17:27:56,151 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-09 17:27:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-09 17:27:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 17:27:56,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:27:56,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] [2018-12-09 17:27:56,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:27:56,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:27:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-09 17:27:56,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:27:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:56,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:27:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:56,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:27:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:27:56,310 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 17:27:56,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:27:56,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:27:56,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:27:56,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:27:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:27:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:27:56,324 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-09 17:27:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:27:56,656 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-09 17:27:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:27:56,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 17:27:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:27:56,796 INFO L225 Difference]: With dead ends: 45389 [2018-12-09 17:27:56,796 INFO L226 Difference]: Without dead ends: 40629 [2018-12-09 17:27:56,797 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 17:27:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-09 17:27:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-09 17:27:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 17:27:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-09 17:27:57,521 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-09 17:27:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:27:57,522 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-09 17:27:57,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:27:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-09 17:27:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:27:57,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:27:57,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:27:57,526 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:27:57,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:27:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-09 17:27:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:27:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:27:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:57,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:27:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:27:57,568 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 17:27:57,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:27:57,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:27:57,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:27:57,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:27:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:27:57,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:27:57,570 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-09 17:27:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:27:57,718 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-09 17:27:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:27:57,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 17:27:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:27:57,789 INFO L225 Difference]: With dead ends: 23663 [2018-12-09 17:27:57,789 INFO L226 Difference]: Without dead ends: 23663 [2018-12-09 17:27:57,790 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 17:27:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-09 17:27:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-09 17:27:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 17:27:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-09 17:27:58,222 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-09 17:27:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:27:58,222 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-09 17:27:58,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:27:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-09 17:27:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:27:58,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:27:58,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:27:58,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:27:58,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:27:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1341601382, now seen corresponding path program 1 times [2018-12-09 17:27:58,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:27:58,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:58,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:27:58,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:58,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:27:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:27:58,266 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 17:27:58,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:27:58,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:27:58,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:27:58,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:27:58,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:27:58,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:27:58,267 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-09 17:27:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:27:58,860 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-09 17:27:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:27:58,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 17:27:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:27:58,981 INFO L225 Difference]: With dead ends: 64831 [2018-12-09 17:27:58,981 INFO L226 Difference]: Without dead ends: 64671 [2018-12-09 17:27:58,981 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 17:27:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-09 17:27:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-09 17:27:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 17:27:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-09 17:27:59,755 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-09 17:27:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:27:59,756 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-09 17:27:59,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:27:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-09 17:27:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 17:27:59,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:27:59,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:27:59,758 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:27:59,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:27:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-09 17:27:59,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:27:59,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:59,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:27:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:27:59,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:27:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:27:59,796 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 17:27:59,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:27:59,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:27:59,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:27:59,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:27:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:27:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:27:59,797 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-09 17:28:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:00,047 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-09 17:28:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:28:00,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 17:28:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:00,107 INFO L225 Difference]: With dead ends: 37143 [2018-12-09 17:28:00,107 INFO L226 Difference]: Without dead ends: 37143 [2018-12-09 17:28:00,107 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 17:28:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-09 17:28:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-09 17:28:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 17:28:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-09 17:28:00,612 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-09 17:28:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:00,612 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-09 17:28:00,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:28:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-09 17:28:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 17:28:00,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:00,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:28:00,615 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:00,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1106347019, now seen corresponding path program 1 times [2018-12-09 17:28:00,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:00,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:00,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:00,655 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 17:28:00,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:00,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:28:00,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:00,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:28:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:28:00,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:00,656 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 4 states. [2018-12-09 17:28:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:00,695 INFO L93 Difference]: Finished difference Result 12365 states and 41168 transitions. [2018-12-09 17:28:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:28:00,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 17:28:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:00,709 INFO L225 Difference]: With dead ends: 12365 [2018-12-09 17:28:00,709 INFO L226 Difference]: Without dead ends: 11844 [2018-12-09 17:28:00,709 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 17:28:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-09 17:28:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-09 17:28:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-09 17:28:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39616 transitions. [2018-12-09 17:28:00,927 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39616 transitions. Word has length 46 [2018-12-09 17:28:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:00,928 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39616 transitions. [2018-12-09 17:28:00,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:28:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39616 transitions. [2018-12-09 17:28:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:28:00,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:00,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:28:00,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:00,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash 597708037, now seen corresponding path program 1 times [2018-12-09 17:28:00,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:00,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:00,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:00,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:00,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:00,988 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 17:28:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:28:00,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:00,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:28:00,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:28:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:00,989 INFO L87 Difference]: Start difference. First operand 11844 states and 39616 transitions. Second operand 4 states. [2018-12-09 17:28:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:01,131 INFO L93 Difference]: Finished difference Result 17020 states and 55692 transitions. [2018-12-09 17:28:01,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:28:01,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 17:28:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:01,152 INFO L225 Difference]: With dead ends: 17020 [2018-12-09 17:28:01,152 INFO L226 Difference]: Without dead ends: 17020 [2018-12-09 17:28:01,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2018-12-09 17:28:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 12880. [2018-12-09 17:28:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2018-12-09 17:28:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 42719 transitions. [2018-12-09 17:28:01,311 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 42719 transitions. Word has length 59 [2018-12-09 17:28:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:01,311 INFO L480 AbstractCegarLoop]: Abstraction has 12880 states and 42719 transitions. [2018-12-09 17:28:01,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:28:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 42719 transitions. [2018-12-09 17:28:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:28:01,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:01,314 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 17:28:01,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:01,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1954448924, now seen corresponding path program 1 times [2018-12-09 17:28:01,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:01,351 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 17:28:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:28:01,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:01,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:28:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:28:01,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:01,352 INFO L87 Difference]: Start difference. First operand 12880 states and 42719 transitions. Second operand 5 states. [2018-12-09 17:28:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:01,378 INFO L93 Difference]: Finished difference Result 2524 states and 6736 transitions. [2018-12-09 17:28:01,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:28:01,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-09 17:28:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:01,381 INFO L225 Difference]: With dead ends: 2524 [2018-12-09 17:28:01,381 INFO L226 Difference]: Without dead ends: 2112 [2018-12-09 17:28:01,381 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 17:28:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2018-12-09 17:28:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2009. [2018-12-09 17:28:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-09 17:28:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5339 transitions. [2018-12-09 17:28:01,395 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5339 transitions. Word has length 59 [2018-12-09 17:28:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:01,395 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5339 transitions. [2018-12-09 17:28:01,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:28:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5339 transitions. [2018-12-09 17:28:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:28:01,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:01,398 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] [2018-12-09 17:28:01,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:01,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -226906360, now seen corresponding path program 1 times [2018-12-09 17:28:01,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:01,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:01,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:01,450 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 17:28:01,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:01,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:28:01,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:01,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:28:01,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:28:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:01,451 INFO L87 Difference]: Start difference. First operand 2009 states and 5339 transitions. Second operand 4 states. [2018-12-09 17:28:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:01,523 INFO L93 Difference]: Finished difference Result 2446 states and 6386 transitions. [2018-12-09 17:28:01,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:28:01,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 17:28:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:01,525 INFO L225 Difference]: With dead ends: 2446 [2018-12-09 17:28:01,525 INFO L226 Difference]: Without dead ends: 2446 [2018-12-09 17:28:01,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-12-09 17:28:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2098. [2018-12-09 17:28:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-12-09 17:28:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 5541 transitions. [2018-12-09 17:28:01,542 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 5541 transitions. Word has length 92 [2018-12-09 17:28:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:01,542 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 5541 transitions. [2018-12-09 17:28:01,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:28:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 5541 transitions. [2018-12-09 17:28:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:28:01,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:01,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] [2018-12-09 17:28:01,544 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:01,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash 742674663, now seen corresponding path program 1 times [2018-12-09 17:28:01,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:01,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:01,573 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 17:28:01,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:01,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:28:01,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:01,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:28:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:28:01,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:01,574 INFO L87 Difference]: Start difference. First operand 2098 states and 5541 transitions. Second operand 4 states. [2018-12-09 17:28:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:01,685 INFO L93 Difference]: Finished difference Result 3056 states and 8111 transitions. [2018-12-09 17:28:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:28:01,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 17:28:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:01,688 INFO L225 Difference]: With dead ends: 3056 [2018-12-09 17:28:01,688 INFO L226 Difference]: Without dead ends: 3056 [2018-12-09 17:28:01,688 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 17:28:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2018-12-09 17:28:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2063. [2018-12-09 17:28:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-12-09 17:28:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 5402 transitions. [2018-12-09 17:28:01,705 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 5402 transitions. Word has length 92 [2018-12-09 17:28:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:01,706 INFO L480 AbstractCegarLoop]: Abstraction has 2063 states and 5402 transitions. [2018-12-09 17:28:01,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:28:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 5402 transitions. [2018-12-09 17:28:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:28:01,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:01,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:28:01,708 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:01,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash 6831737, now seen corresponding path program 2 times [2018-12-09 17:28:01,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:28:01,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:01,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:28:01,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:01,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:28:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:28:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:01,758 INFO L87 Difference]: Start difference. First operand 2063 states and 5402 transitions. Second operand 5 states. [2018-12-09 17:28:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:01,874 INFO L93 Difference]: Finished difference Result 2421 states and 6268 transitions. [2018-12-09 17:28:01,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:28:01,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 17:28:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:01,876 INFO L225 Difference]: With dead ends: 2421 [2018-12-09 17:28:01,877 INFO L226 Difference]: Without dead ends: 2421 [2018-12-09 17:28:01,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:28:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-12-09 17:28:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2059. [2018-12-09 17:28:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2018-12-09 17:28:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 5393 transitions. [2018-12-09 17:28:01,892 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 5393 transitions. Word has length 92 [2018-12-09 17:28:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:01,893 INFO L480 AbstractCegarLoop]: Abstraction has 2059 states and 5393 transitions. [2018-12-09 17:28:01,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:28:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 5393 transitions. [2018-12-09 17:28:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:28:01,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:01,895 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] [2018-12-09 17:28:01,895 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:01,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1791236764, now seen corresponding path program 1 times [2018-12-09 17:28:01,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:28:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:01,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:01,916 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 17:28:01,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:01,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:28:01,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:01,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:28:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:28:01,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:28:01,917 INFO L87 Difference]: Start difference. First operand 2059 states and 5393 transitions. Second operand 3 states. [2018-12-09 17:28:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:01,987 INFO L93 Difference]: Finished difference Result 2109 states and 5500 transitions. [2018-12-09 17:28:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:28:01,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-09 17:28:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:01,989 INFO L225 Difference]: With dead ends: 2109 [2018-12-09 17:28:01,989 INFO L226 Difference]: Without dead ends: 2109 [2018-12-09 17:28:01,989 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 17:28:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2018-12-09 17:28:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2071. [2018-12-09 17:28:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2018-12-09 17:28:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5417 transitions. [2018-12-09 17:28:02,003 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5417 transitions. Word has length 92 [2018-12-09 17:28:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:02,003 INFO L480 AbstractCegarLoop]: Abstraction has 2071 states and 5417 transitions. [2018-12-09 17:28:02,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:28:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5417 transitions. [2018-12-09 17:28:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:02,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:02,005 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] [2018-12-09 17:28:02,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:02,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1380045558, now seen corresponding path program 1 times [2018-12-09 17:28:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:02,030 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 17:28:02,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:02,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:28:02,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:02,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:28:02,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:28:02,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:02,031 INFO L87 Difference]: Start difference. First operand 2071 states and 5417 transitions. Second operand 4 states. [2018-12-09 17:28:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:02,115 INFO L93 Difference]: Finished difference Result 3968 states and 10468 transitions. [2018-12-09 17:28:02,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:28:02,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 17:28:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:02,118 INFO L225 Difference]: With dead ends: 3968 [2018-12-09 17:28:02,118 INFO L226 Difference]: Without dead ends: 3968 [2018-12-09 17:28:02,118 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 17:28:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2018-12-09 17:28:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 2055. [2018-12-09 17:28:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-12-09 17:28:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5336 transitions. [2018-12-09 17:28:02,138 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5336 transitions. Word has length 94 [2018-12-09 17:28:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:02,138 INFO L480 AbstractCegarLoop]: Abstraction has 2055 states and 5336 transitions. [2018-12-09 17:28:02,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:28:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5336 transitions. [2018-12-09 17:28:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:02,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:02,140 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] [2018-12-09 17:28:02,140 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:02,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1050279797, now seen corresponding path program 1 times [2018-12-09 17:28:02,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:02,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:02,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:02,186 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 17:28:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:02,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:28:02,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:02,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:28:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:28:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:28:02,187 INFO L87 Difference]: Start difference. First operand 2055 states and 5336 transitions. Second operand 6 states. [2018-12-09 17:28:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:02,359 INFO L93 Difference]: Finished difference Result 2334 states and 5888 transitions. [2018-12-09 17:28:02,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:28:02,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 17:28:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:02,361 INFO L225 Difference]: With dead ends: 2334 [2018-12-09 17:28:02,361 INFO L226 Difference]: Without dead ends: 2264 [2018-12-09 17:28:02,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:28:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2018-12-09 17:28:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2197. [2018-12-09 17:28:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2197 states. [2018-12-09 17:28:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 5622 transitions. [2018-12-09 17:28:02,375 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 5622 transitions. Word has length 94 [2018-12-09 17:28:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:02,375 INFO L480 AbstractCegarLoop]: Abstraction has 2197 states and 5622 transitions. [2018-12-09 17:28:02,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:28:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 5622 transitions. [2018-12-09 17:28:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:02,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:02,377 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] [2018-12-09 17:28:02,377 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:02,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 650460682, now seen corresponding path program 1 times [2018-12-09 17:28:02,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:28:02,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:02,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:28:02,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:02,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:28:02,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:28:02,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:28:02,430 INFO L87 Difference]: Start difference. First operand 2197 states and 5622 transitions. Second operand 7 states. [2018-12-09 17:28:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:02,604 INFO L93 Difference]: Finished difference Result 2415 states and 6161 transitions. [2018-12-09 17:28:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:28:02,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 17:28:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:02,606 INFO L225 Difference]: With dead ends: 2415 [2018-12-09 17:28:02,606 INFO L226 Difference]: Without dead ends: 2415 [2018-12-09 17:28:02,606 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 17:28:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2018-12-09 17:28:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2181. [2018-12-09 17:28:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-12-09 17:28:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5589 transitions. [2018-12-09 17:28:02,621 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5589 transitions. Word has length 94 [2018-12-09 17:28:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:02,621 INFO L480 AbstractCegarLoop]: Abstraction has 2181 states and 5589 transitions. [2018-12-09 17:28:02,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:28:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5589 transitions. [2018-12-09 17:28:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:02,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:02,623 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] [2018-12-09 17:28:02,623 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:02,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:02,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2061340202, now seen corresponding path program 1 times [2018-12-09 17:28:02,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:02,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:02,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:28:02,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:02,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:28:02,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:02,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:28:02,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:28:02,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:02,667 INFO L87 Difference]: Start difference. First operand 2181 states and 5589 transitions. Second operand 5 states. [2018-12-09 17:28:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:02,785 INFO L93 Difference]: Finished difference Result 4042 states and 10543 transitions. [2018-12-09 17:28:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:28:02,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 17:28:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:02,788 INFO L225 Difference]: With dead ends: 4042 [2018-12-09 17:28:02,788 INFO L226 Difference]: Without dead ends: 4016 [2018-12-09 17:28:02,789 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 17:28:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-12-09 17:28:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2235. [2018-12-09 17:28:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-12-09 17:28:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 5715 transitions. [2018-12-09 17:28:02,809 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 5715 transitions. Word has length 94 [2018-12-09 17:28:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:02,809 INFO L480 AbstractCegarLoop]: Abstraction has 2235 states and 5715 transitions. [2018-12-09 17:28:02,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:28:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 5715 transitions. [2018-12-09 17:28:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:02,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:02,811 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] [2018-12-09 17:28:02,811 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:02,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1443186967, now seen corresponding path program 1 times [2018-12-09 17:28:02,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:02,875 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 17:28:02,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:02,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:28:02,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:02,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:28:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:28:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:02,876 INFO L87 Difference]: Start difference. First operand 2235 states and 5715 transitions. Second operand 5 states. [2018-12-09 17:28:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:02,944 INFO L93 Difference]: Finished difference Result 1991 states and 5072 transitions. [2018-12-09 17:28:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:28:02,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 17:28:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:02,946 INFO L225 Difference]: With dead ends: 1991 [2018-12-09 17:28:02,946 INFO L226 Difference]: Without dead ends: 1991 [2018-12-09 17:28:02,946 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 17:28:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-12-09 17:28:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1989. [2018-12-09 17:28:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-12-09 17:28:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5068 transitions. [2018-12-09 17:28:02,964 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5068 transitions. Word has length 94 [2018-12-09 17:28:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:02,964 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5068 transitions. [2018-12-09 17:28:02,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:28:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5068 transitions. [2018-12-09 17:28:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:02,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:02,966 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] [2018-12-09 17:28:02,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:02,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1220650390, now seen corresponding path program 1 times [2018-12-09 17:28:02,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:02,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:03,006 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 17:28:03,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:03,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:28:03,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:03,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:28:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:28:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:28:03,007 INFO L87 Difference]: Start difference. First operand 1989 states and 5068 transitions. Second operand 4 states. [2018-12-09 17:28:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:03,086 INFO L93 Difference]: Finished difference Result 2325 states and 5988 transitions. [2018-12-09 17:28:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:28:03,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 17:28:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:03,090 INFO L225 Difference]: With dead ends: 2325 [2018-12-09 17:28:03,090 INFO L226 Difference]: Without dead ends: 2325 [2018-12-09 17:28:03,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 17:28:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-09 17:28:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2293. [2018-12-09 17:28:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-09 17:28:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-09 17:28:03,118 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-09 17:28:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:03,118 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-09 17:28:03,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:28:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-09 17:28:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:28:03,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:03,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:28:03,122 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:03,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 997107563, now seen corresponding path program 1 times [2018-12-09 17:28:03,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:03,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:28:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:28:03,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:03,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:28:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:28:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:28:03,202 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-09 17:28:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:03,270 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-09 17:28:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:28:03,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 17:28:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:03,273 INFO L225 Difference]: With dead ends: 2005 [2018-12-09 17:28:03,273 INFO L226 Difference]: Without dead ends: 2005 [2018-12-09 17:28:03,273 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 17:28:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-09 17:28:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-09 17:28:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-09 17:28:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-09 17:28:03,292 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-09 17:28:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:03,292 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-09 17:28:03,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:28:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-09 17:28:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:28:03,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:03,294 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] [2018-12-09 17:28:03,295 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:03,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-09 17:28:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:03,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 17:28:03,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:03,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:28:03,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:03,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 17:28:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 17:28:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:28:03,360 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-09 17:28:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:03,772 INFO L93 Difference]: Finished difference Result 4730 states and 12191 transitions. [2018-12-09 17:28:03,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 17:28:03,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 17:28:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:03,776 INFO L225 Difference]: With dead ends: 4730 [2018-12-09 17:28:03,776 INFO L226 Difference]: Without dead ends: 4730 [2018-12-09 17:28:03,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-09 17:28:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-09 17:28:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 2396. [2018-12-09 17:28:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2018-12-09 17:28:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 6085 transitions. [2018-12-09 17:28:03,807 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 6085 transitions. Word has length 96 [2018-12-09 17:28:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:03,807 INFO L480 AbstractCegarLoop]: Abstraction has 2396 states and 6085 transitions. [2018-12-09 17:28:03,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 17:28:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 6085 transitions. [2018-12-09 17:28:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:28:03,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:03,837 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] [2018-12-09 17:28:03,838 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:03,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:03,838 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-09 17:28:03,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:03,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:03,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:03,889 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 17:28:03,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:03,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:28:03,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:03,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:28:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:28:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:03,889 INFO L87 Difference]: Start difference. First operand 2396 states and 6085 transitions. Second operand 5 states. [2018-12-09 17:28:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:03,917 INFO L93 Difference]: Finished difference Result 4125 states and 10700 transitions. [2018-12-09 17:28:03,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:28:03,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 17:28:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:03,920 INFO L225 Difference]: With dead ends: 4125 [2018-12-09 17:28:03,920 INFO L226 Difference]: Without dead ends: 4125 [2018-12-09 17:28:03,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:28:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2018-12-09 17:28:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2333. [2018-12-09 17:28:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2018-12-09 17:28:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 5892 transitions. [2018-12-09 17:28:03,941 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 5892 transitions. Word has length 96 [2018-12-09 17:28:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:03,941 INFO L480 AbstractCegarLoop]: Abstraction has 2333 states and 5892 transitions. [2018-12-09 17:28:03,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:28:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 5892 transitions. [2018-12-09 17:28:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:28:03,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:03,943 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] [2018-12-09 17:28:03,943 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:03,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-09 17:28:03,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:03,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:03,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 17:28:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:03,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:28:03,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:03,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:28:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:28:03,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:28:03,996 INFO L87 Difference]: Start difference. First operand 2333 states and 5892 transitions. Second operand 5 states. [2018-12-09 17:28:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:04,093 INFO L93 Difference]: Finished difference Result 2653 states and 6692 transitions. [2018-12-09 17:28:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:28:04,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 17:28:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:04,095 INFO L225 Difference]: With dead ends: 2653 [2018-12-09 17:28:04,095 INFO L226 Difference]: Without dead ends: 2653 [2018-12-09 17:28:04,095 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 17:28:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2018-12-09 17:28:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2081. [2018-12-09 17:28:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-12-09 17:28:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 5265 transitions. [2018-12-09 17:28:04,110 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 5265 transitions. Word has length 96 [2018-12-09 17:28:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:04,110 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 5265 transitions. [2018-12-09 17:28:04,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:28:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 5265 transitions. [2018-12-09 17:28:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:28:04,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:04,111 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] [2018-12-09 17:28:04,112 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:04,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-09 17:28:04,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:04,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:04,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:04,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:04,230 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 17:28:04,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:04,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:28:04,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:04,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:28:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:28:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:28:04,231 INFO L87 Difference]: Start difference. First operand 2081 states and 5265 transitions. Second operand 10 states. [2018-12-09 17:28:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:04,503 INFO L93 Difference]: Finished difference Result 3834 states and 9903 transitions. [2018-12-09 17:28:04,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:28:04,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 17:28:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:04,504 INFO L225 Difference]: With dead ends: 3834 [2018-12-09 17:28:04,505 INFO L226 Difference]: Without dead ends: 1799 [2018-12-09 17:28:04,505 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 17:28:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-09 17:28:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-09 17:28:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-09 17:28:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-09 17:28:04,516 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-09 17:28:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:04,516 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-09 17:28:04,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:28:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-09 17:28:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:28:04,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:04,517 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] [2018-12-09 17:28:04,518 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:04,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-09 17:28:04,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:04,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:28:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:04,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:28:04,623 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 17:28:04,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:28:04,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 17:28:04,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:28:04,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 17:28:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 17:28:04,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:28:04,624 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-09 17:28:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:28:04,964 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-09 17:28:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 17:28:04,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-09 17:28:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:28:04,966 INFO L225 Difference]: With dead ends: 3406 [2018-12-09 17:28:04,966 INFO L226 Difference]: Without dead ends: 2430 [2018-12-09 17:28:04,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:28:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-09 17:28:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-09 17:28:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-09 17:28:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-09 17:28:04,983 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-09 17:28:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:28:04,983 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-09 17:28:04,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 17:28:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-09 17:28:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:28:04,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:28:04,985 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] [2018-12-09 17:28:04,985 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:28:04,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:28:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-09 17:28:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:28:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:04,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:28:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:28:04,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:28:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:28:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:28:05,032 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 17:28:05,120 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 17:28:05,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:28:05 BasicIcfg [2018-12-09 17:28:05,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:28:05,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:28:05,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:28:05,122 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:28:05,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:27:55" (3/4) ... [2018-12-09 17:28:05,125 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 17:28:05,210 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_934ac932-3eea-41cf-b9e0-4b61ede9091f/bin-2019/utaipan/witness.graphml [2018-12-09 17:28:05,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:28:05,211 INFO L168 Benchmark]: Toolchain (without parser) took 10797.86 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 953.5 MB in the beginning and 1.6 GB in the end (delta: -601.1 MB). Peak memory consumption was 772.5 MB. Max. memory is 11.5 GB. [2018-12-09 17:28:05,212 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:28:05,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-09 17:28:05,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:28:05,213 INFO L168 Benchmark]: Boogie Preprocessor took 19.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:28:05,213 INFO L168 Benchmark]: RCFGBuilder took 356.20 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: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-09 17:28:05,213 INFO L168 Benchmark]: TraceAbstraction took 9969.71 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -516.1 MB). Peak memory consumption was 713.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:28:05,214 INFO L168 Benchmark]: Witness Printer took 88.29 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-09 17:28:05,215 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 356.20 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: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9969.71 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -516.1 MB). Peak memory consumption was 713.9 MB. Max. memory is 11.5 GB. * Witness Printer took 88.29 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1615; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1616; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -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) [L786] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -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)) [L787] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -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)) [L788] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -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)) [L789] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -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)) [L790] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -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)) [L791] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -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)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 9.9s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4856 SDtfs, 4424 SDslu, 9815 SDs, 0 SdLazy, 3232 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 65 SyntacticMatches, 17 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37143occurred 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: 3.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 59694 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1940 NumberOfCodeBlocks, 1940 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1821 ConstructedInterpolants, 0 QuantifiedInterpolants, 342397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...